搜索资源列表
最大团问题的各种算法和源代码
- 最大团问题（Maximum Clique Problem, MCP）是图论中一个经典的组合优化问题，也是一类NP完全问题，在国际上已有广泛的研究，而国内对MCP问题的研究则还处于起步阶段，因此，研究最大团问题具有较高的理论价值和现实意义。 最大团问题又称为最大独立集问题（Maximum Independent Set Problem），在市场分析、方案选择、信号传输、计算机视觉、故障诊断等领域具有非常广泛的应用。目前，求解MCP问题的算法主要分为两类：确定性算法和启发式算法。确定性算法有回溯法
mc-problem
- N个传教士和野人的渡河问题，采用递归算法-Missionaries and the savages of N crossing problem, using a recursive algorithm
SY0915129
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence t
MC-Solve
- 野人与传教士问题的求解程序，对N=3，K=2给出正确路径-Savage with the missionary problem solving procedures, N = 3, K = 2 are given the correct path
MC
- Java实现的野人传教士问题，输入可行路径。-java，M.C. problem.
MC_java
- 人工智能，回溯方法解MC问题，java语言。主要算法在MC.java中，test.java是测试程序，运行test.java程序即可。-Artificial intelligence, backtracking method to solve the MC problem, java language. MC.java in the main algorithm, test.java is a test program, run test.java procedures.
mc
- MATLAB编写的蒲丰氏问题的蒙特卡洛仿真-MATLAB prepared by Buffon s the problem of Monte Carlo Simulation
rengongzhineng
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence t
MCproblem
- 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A*算法，规则设计采用产生式规则，用C语言实现了A*算法求解M-C问题，加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missionaries studied in this experimen
MC
- 用java语言实现的人工智能中野人传教士问题的解决办法-Using java language implementation of artificial intelligence in the Savage missionaries solution to the problem
MC
- c++解决野人与传教士问题，比较经典，源代码结构清晰-Savage c++ to solve the problem with the missionaries, more classic, clear source code structure
MC
- 利用lingo求解最小连接问题 !如果数据量大的话，还是用书上的算法简单实用，见 数学建模导论 68页 -Minimum connection problem solving using lingo! If large volume of data, then he used the book simple and practical algorithm, see page 68 Introduction to mathematical modeling
Estimation_Theory
- In this project, we consider the problem of estimating a parameter associated with the local oscillator leakage of a RF receiver by tone test. For this reason, an approxi- mate maximum-likelihood (ML) estimator is proposed. It s error performance
MC
- MC(传教士-野人）问题，VS2008编译通过，输入格式为MC.exe 输入文件名 输出文件名，输入文件中为传教士（野人）数n和船容量k，输出文件为路径-MC (Missionaries- Savage) problem, VS2008 compiler, enter the name of the input file format MC.exe output file name, input file for the missionaries (Savage) n and boat capa
MCproblem
- 经典的MC问题(野人和传教士问题)，给定人数和船载人的数目，即可给出一个解，解的形式是一个三元组的序列，分别表示每一步之后左岸的人数和船的位置。-Classic MC problem (Savage and missionaries problem), given the number and the number of ships manned, to give a solution, the solution in the form of a sequence of triples, res
marching_cubes_jgt
- 在MC（Marching Cubes）算法中,考虑了二义性的问题，是一个很好的程序-MC (Marching Cubes) algorithm, consider the ambiguity problem, it is a good program
PSO-MC
- PSO算法和蒙塔卡洛算法的混合算法，求解非线性方程组。单目标优化问题-Hybrid algorithm of PSO and Monta Carlo algorithms for solving nonlinear equations. Single-objective optimization problem
1MIMO-downlinked
- However, to the authors knowledge, the implementation of this idea in the context of MIMO MC-CDMA communications has never been addressed. In this study, our aim is also to develop strategies to alleviate the inherent complexity of the underlying min
MC
- MC问题（AI）的解答，用JAVA实现。野人与传教士问题。（ArrayList）-The solution to MC problem which is so typical in AI field ,when it comes to the expression of knowledge.Use Java.ArrayList
Source1
- VS+IVF，运用Fortran语言对一维黎曼问题进行求解(Vs + IVF, using FORTRAN language to solve one-dimensional Riemann problem)