Location:
Search - Optimal Search
Search list
Description: 直线搜索可以为最优化提供搜索区间。上述算法的终止准则为H终止准则。通用程序。
①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
-straight search for the optimal search interval. This algorithm criteria for the termination of H termination criteria. Common procedures. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in other reference materials or arbitrary selection procedures to prepare themselves (called ban on the use of existing software), on-demand programming language.
Platform: |
Size: 35444 |
Author: 红男 |
Hits:
Description: 我用C++编写的二分最优查找!希望大家能用的着!-prepared by the two sub-optimal search! The hope everyone can be with! Thank you! !
Platform: |
Size: 984 |
Author: 于飞 |
Hits:
Description: TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.
Platform: |
Size: 1357824 |
Author: 霍哲 |
Hits:
Description: 提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth- first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample programs.
Platform: |
Size: 12288 |
Author: 陈宁 |
Hits:
Description: 直线搜索可以为最优化提供搜索区间。上述算法的终止准则为H终止准则。通用程序。
①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
-straight search for the optimal search interval. This algorithm criteria for the termination of H termination criteria. Common procedures. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in other reference materials or arbitrary selection procedures to prepare themselves (called ban on the use of existing software), on-demand programming language.
Platform: |
Size: 34816 |
Author: 红男 |
Hits:
Description: 我用C++编写的二分最优查找!希望大家能用的着!-prepared by the two sub-optimal search! The hope everyone can be with! Thank you! !
Platform: |
Size: 1024 |
Author: 于飞 |
Hits:
Description: pso算法的代码，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值，-PSO algorithm code is based on an iterative optimization tools. Initialize the system for a group of random solutions, through iterative search for the optimal values,
Platform: |
Size: 128000 |
Author: 张林 |
Hits:
Description: 该源程序是用动态规划算法求解最优二叉搜索树问题-the source is dynamic programming algorithm for optimal binary search tree problem
Platform: |
Size: 205824 |
Author: 杨锐 |
Hits:
Description: Build an optimal binary search tree using dynamic programming.-Build an optimal binary search tree using d ynamic programming.
Platform: |
Size: 538624 |
Author: zhoushusen |
Hits:
Description: 最优二分检索树,欢迎下载
呵呵 大家多支持-Optimal binary search trees, all more than welcome to download huh support
Platform: |
Size: 1024 |
Author: lanjinhe |
Hits:
Description: 局部搜索法求解N皇后问题。这个算法的特点是引入随机因素，每次运行并不能保证求得问题的最优解，但经过运行之后，一般总能得到一个与最优解相差不大的满意解。-Local Search Method for Solving N Queens problem. The algorithm is characterized by the introduction of random factors, each running and can not guarantee to achieve the optimal solution of the problem, but after running, the general always be an optimal solution is no less than satisfactory solution.
Platform: |
Size: 1024 |
Author: 清和信平 |
Hits:
Description: 粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation)，有Eberhart博士和kennedy博士发明。源于对鸟群捕食的行为研究
PSO同遗传算法类似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在解空间追随最优的粒子进行搜索。详细的步骤以后的章节介绍
同遗传算法比较，PSO的优势在于简单容易实现并且没有许多参数需要调整。目前已广泛应用于函数优化，神经网络训练，模糊系统控制以及其他遗传算法的应用领域-Particle Swarm Optimization (PSO) is an evolutionary computation technique (evolutionary computation), has Dr. Eberhart and Dr. kennedy invention. Deriving from the behavior of birds of prey PSO with genetic algorithm is similar to an iterative optimization-based tools. System initialization for a group of random solutions, through the iterative search for optimal values. But there is no cross-genetic algorithm used (crossover) and mutation (mutation). But the particles in the solution space of the particles to follow the optimal search. In detail the steps after the introduction sections compared with the genetic algorithm, PSO has the advantage of being simple and easy and did not realize many of the parameters need to be adjusted. Has been widely applied to function optimization, neural network training, fuzzy system control, as well as other genetic algorithm applications
Platform: |
Size: 22528 |
Author: zzh |
Hits:
Description: 该软件是有关禁忌搜索的程序，该程序能很快找到优化解，能够得到很好的应用。-The software is the tabu search procedure, the program can quickly find the optimal solution, can be a very good application.
Platform: |
Size: 281600 |
Author: 罗常 |
Hits:
Description: 最优二叉搜索树
采用c语言编写的最优二叉搜索树算法。实现其的遍历及构造-Optimal binary search tree using c language of optimal binary search tree algorithm. Realize its Ergodic and tectonic
Platform: |
Size: 76800 |
Author: 李浩 |
Hits:
Description: Optimal binary search tr-Optimal binary search tree
Platform: |
Size: 1024 |
Author: abocs1984 |
Hits:
Description: 五子棋游戏，采用alpha-beta剪枝优化搜索算法，深度可达6步。-five-chess game, with alpha-beta optimal search algorithm, the depth is up to 6 steps
Platform: |
Size: 1544192 |
Author: ling |
Hits:
Description: 机械优化设计的作业 包括一维搜索方法（二次差值，牛顿法，黄金分割法），以及最速下降法和内点惩罚函数法及等值线图-Optimal Design of mechanical operations, including one-dimensional search method (the second difference, Newton' s law, golden section method), and the steepest descent method and interior point penalty function method and the contour map
Platform: |
Size: 12697600 |
Author: 王正宇 |
Hits:
Description: Search Optimal Path Algorithm.
Platform: |
Size: 182272 |
Author: michael |
Hits:
Description: Up to this point, we have assumed that an optimal search tree is one in which the probability of occurrence of all keys is
equal (or is unknown, in which case we assume it to be equal). Thus we concentrated on balancing the tree so as to
make the cost of finding any key at most log n.
Platform: |
Size: 1024 |
Author: ARUN BALAN |
Hits:
Description: 人工智能上机作业源代码，经编译能运行，实现最优搜索的程序-Artificial intelligence operations on the machine source code can be compiled to run, to achieve optimal search procedures
Platform: |
Size: 3072 |
Author: 高昊 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
24
»