搜索资源列表
TIERRA
- 地球模拟器，最经典的人工生命模型,研究人工智能的必看。一般地说，生命都具有新陈代谢、复制和进化的能力。在自然界中，生物是由有限的食物供给和有限的生存空间约束的。在Tierra中，“生物”由一系列能够自我复制的机器代码或程序组成，它在计算机中的复制分别受到计算机的存储空间和CPU时间约束。能有效地占有内存空间和利用CPU时间的生物体，将具有更高的适应度，传递到下一代的机会就越大。 在Tierra中，计算机的RAM（随机访问存储器）中有一块专门的空间，这个空间中放置了一个“祖先有机体”，该祖先有
SGALAB1003beta3withdoc
- run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here: http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=5882 What s new: 1)fixed a critical bug in selection operation 2)update the 13 c
jlplq0
- 不等式约束线性规划问题求解（可求解不等式约束条件下的线性规划问题）-inequality constraint solving linear programming problems (can be calculated under the conditions of inequality constraints of linear programming)
functionz1
- 寻找三次样条多项式需要求解大量的线性方程。实际上，给定N个断点，就要寻找N-1个三次多项式，每个多项式有4个未知系数。这样，所求解的方程组包含有4*(N-1)个未知数。把每个三次多项式列成特殊形式，并且运用各种约束，通过求解N个具有N个未知系数的方程组，就能确定三次多项式。 -find cubic spline solving polynomial need a lot of linear equations. In fact, given N breakpoints, it is nece
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
wavelet_constran
- 小波变换的条件限制的实现的编程，可以更好设计优化问题-wavelet transform constraints on the realization of the program, we can better design optimization problems
liyingnan_3
- 解线性规划，等式约束和不等式约束均有，得到附和约束条件的一组最优解。-linear programming solution, equality and inequality constraints have been echoed by a restrictive conditions Optimal Solutions Group.
RanMethod
- 随机搜索法,用于大型复杂优化问题.该方法只支持变量的范围约束,不支持其它类型的约束.-random search method for large complex optimization problems. The only support the scope of variables bound not to support other types of constraints.
Chance_Constrained_Multilevel_Programming
- 机会约束的多层规划求解模型及程序代码，人工智能的进化应用于不确定环境-chance constraints planning for the multi-model and program code, the evolution of artificial intelligence applied to an uncertain environment
tlsf
- 算法的许多例子都是最优化问题（ optimization problem），每个最优化问题都包含一组限制条件（ c o n s t r a i n t）和一个优化函数（ optimization function），符合限制条件的问题求解方案称为可行解（ feasible solution），使优化函数取得最佳值的可行解称为最优解（optimal solution）。-algorithm are many examples of optimization problems (optimizati
jlab
- JLAB is a set of Matlab functions I have written or co-written over the past fifteen years for the purpose of analyzing data. It consists of four hundred m-files spanning thirty thousand lines of code. JLAB includes functions ranging in complexity fr
gacode-in-c
- This a GA implementation using binary and real coded variables. Mixed variables can be used. Constraints can also be handled. All constraints must be greater-than-equal-to type (g >= 0) and normalized (see the sample problem in prob1 in objective(
tanxinfa
- 算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
NMF.zip
- 很不错的NMF代码！里面对NMF做了一个非常巧妙的非负限制.,NMF code is very good! NMF done inside of a very clever non-negative constraints.
GNMF
- 菜登和何晓飞, 2010的PAMI 基于图的非负矩阵分解的paper极其matlab代码。这篇文章在非负矩阵分解中巧妙地加入了流形约束，并推导出了相应的迭代公式。-He Xiaofei Teng and vegetables, 2010 PAMI graph-based non-negative matrix factorization of the paper is extremely matlab code. This article in the non-negative matrix
psopt20100414
- 粒子群算法的matab程序 可以求解带非线性约束的优化问题-a pso code which can slove optimization problems with nonlinear constraints.
PSO
- pso 的实现 应用了c#进行编程 还含有带约束的MATLAB的pso-pso implementation of the application of c# programming with constraints also contains MATLAB-pso
joint-task-constraints-v2.0
- Demo1: Demonstration of the use of Gaussian Mixture Regression (GMR) and inverse kinematics to reproduce a task by considering constraints both in joint space and in task space. An arm of 2 links moving in 2D space is considered. Several demo
constraints
- 根据模式将得到tau的线性化限制。 模式包括: one of euclidean , euclidean_notranslation , affine , affine_notranslation , homography 。-constraints() will get the linearize constraints of tau according to mode.
discrete-mpc-with-constraints
- 模型预测控制 多输入多输出 2自由度汽车模型 多目标有约束优化问题-model predictive control with 2dof vehicle model with constraints optimization problem