搜索资源列表
automix
- he AutoMix package is a C program for Unix-like systems, implementing the automatic reversible jump MCMC sampler of the same name described in Chapters 4, 5, and 6 of David Hastie s Ph.D. thesis-he AutoMix package is a C program for Unix-l ike s
Tribes_doc
- 牛人MC clerc的pso文章。Tribes pso！
TRIBES_BM.ZIP
- MC clerc的tribes PSO 解决TSP问题！
MC
- 上人工智能课的时候写的一个小程序,用于求解传教士与野人问题,用的是A算法.
MC问题的A*
- 利用启发式搜索出MC问题
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.
Backtrack_M_C
- 人工智能经典问题M-C问题（传教士-野人）的C语言实现-MC classic problems of artificial intelligence problems (missionary- Yeti) C-language implementation
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
HMM
- This paper presents a hybrid framework of feature extraction and hidden Markov modeling (HMM) for two-dimensional pattern recognition. Importantly, we explore a new discriminative training criterion to assure model compactness and discriminability. T
MC
- c++解决野人与传教士问题，比较经典，源代码结构清晰-Savage c++ to solve the problem with the missionaries, more classic, clear source code structure
MC
- 传教士野人问题，有N个传教士和N个野人，船每次之多可供k个人乘渡。输出一个可以令传教士和野人安全从左岸全部摆渡到右岸的过程。-failed to translate
god
- 传教士与野人问题(MC问题)的优化广搜 数量不限制-Missionaries and the Savage issue (MC issues) does not limit the number of optimized wide search
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
time
- mc time and tiny c、/c-mc time and tiny c、/c++
conv
- monte carle mc conv c/c-monte carle conv c/c++