搜索资源列表
A__Pathfin1534641262003
- This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values. -A * pathfinding
LL(1)
- LL(1)语法分析1、实现LL(1)分析中控制程序(表驱动程序); 2、完成以下描述算术表达式的LL(1)文法的LL(1)分析程序。 G[E]: E→TE′ E′→ATE′|ε T→FT′ T′→MFT′|ε F→ (E)|i A→+|- M→*|/-LL (1) syntax analysis 1, the realization of LL (1) Analysis of control procedures (table-driven procedure
Multi-Agent-Particle-Swarm-Algorithm
- 结合多智能体的学习、协调策略及粒子群算法,提出了一种基于多智能体粒子群优化的配电网络重构方法。该方法采用粒子群算法的拓扑结构来构建多智能体的体系结构,在多智能体系统中,每一个粒子作为一个智能体,通过与邻域的智能体竞争、合作。能够更快、更精确地收敛到全局最优解。粒子的更新规则减少了算法不可行解的产生,提高了算法效率。实验结果表明,该方法具有很高的搜索效率和寻优性能。-Combining the study of multi-agent technology,coordinating strateg
fentao
- 五只猴子合作摘了很多桃子,感到累了,决定先去睡觉,醒后再分。不知过了多久,第一只猴子醒了,看见其它猴子都没有醒,就把所有桃子分为五堆,发现多一个,就吃了一个,拿走一堆,把剩下的又堆在一起走了。第2只猴子醒来,以为自己是第一个,也是把桃子分为五堆,也是多一个,就吃了一个,拿走一堆,剩下的又堆在一起走了。第3,4,5只猴子都是这样。现在问总共摘了多少桃子,每只猴子连吃再拿是多少?最后还剩多少?-Five monkeys co-picked peaches, tired and decided to
MATLAB-code-that-implements-the-univari-ate-adapt
- MATLAB code that implements the univari-ate adaptive mixtures density estimation procedure.
实验3
- 猴子吃桃子问题 有一群猴子摘了一堆桃子,他们每天都吃当前桃子的一半且再多吃一个,到了第10天就只余下一个桃子。用多种方法实现求出原来这群猴子共摘了多少个桃子。(Monkey eat peaches A group of monkeys picked up a pile of peaches. They ate half of the current peaches and ate one more every day. In the tenth day, the rest of the
花生米问题
- 1、Tom和Jerry轮流从堆中取出k粒花生米吃掉,k可以是1,5,10中的任意一个数字; 2、为显示规则的公平性,Jerry可以选择先取或者后取。 Jerry当然还是希望最后一粒花生米被Tom吃掉。请计算,Jerry为了达到目的应该先取还是后取(1. Tom and Jerry took out the k peanuts and ate them from the heap. K could be any number in 1, 5, and 10. 2. To show the