搜索资源列表
Gsp-Algorithm
- GSP算法的实现程序，具有java的GUI界面-Implementation of the algorithm GSP program has a GUI interface for java
eightpuzzle
- 八数码问题，利用A*算法求解八数码问题，其中h函数为不在位将牌数-8 digital issues, the use of A* algorithm to solve 8 digital issues, including h function is the number of licenses is not in place to
TSP
- 用A星算法解决TSP问题，其中的择优函数选的是最小生成树-A star with the algorithm to solve TSP problems, the merit function is the minimum spanning tree selected
tsp
- 用的是遗传算法.实现了货郎担的模拟，图形界面-Using a genetic algorithm. Realized the TSP simulation, graphical interface
udp-reliable-data-transmission
- UDP实现可靠数据传输。使用GBN算法，实现了：1.随即丢包(随机数产生器Math.random()) 2.丢包后遇冗余ack重传 3.超时重传 (DatagramSocket和Socket都有成员函数setSoTimeout(delay),通过捕获超时时抛出的IO异常来实现超时重传)-Reliable UDP data transfer. GBN algorithm used to realize: 1. Then packet loss (random number generator Ma
RSSI
- 该方法是利用RSSI算法进行节点之间定位的一种方法。-This method is the use of RSSI between node positioning algorithm in a way.
Asearch
- 基于java语言，用A*算法实现八数码问题-Java-based language, using A* algorithm to achieve the eight digital issues
zdxd
- 自动寻道算法，flash实现，主要使用A*算法-Automatically seek algorithm, flash to achieve, mainly the use of A* algorithm
A
- 这是我根据A*算法，通过javascr ipt实现的最短路径程序。可以说，程序非常糟糕，不过总算是实现了。思路是起点和终点的跑动过程中，我们中间可能会遇到障碍物，所以，我们不能仅仅是两点一直线，而是聪明的饶过障碍物进行聪明的跑动-This is my under the A* algorithm, through the javascr ipt to achieve the shortest path procedure. It can be said that the procedure is
router
- 这个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm, the use of java programming.
LogFac_Exp_1
- java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to s
222jfilecrypt
- 很强的JAVA加密、解密算法源码，一共有6种算法可供选择，另外还可以直接生成ZIP压缩文件。 -JAVA strong encryption, decryption algorithm source, a total of six kinds of algorithms to choose from, also can directly generate ZIP compressed file.
tsp_applet
- 一个非常好的，用 Java 实现ACO算法对TSP问题进行求解的 applet，界面可调参数-A very good, using Java to achieve ACO algorithm for solving TSP problems applet, the interface adjustable parameters
hill
- 爬山算法是一种局部择优的方法，采用启发式方法，是对深度优先搜索的一种改进，它利用反馈信息帮助生成解的决策。 属于人工智能算法的一种。-Climbing algorithm is a partial merit-based approach, using heuristic methods, is a depth-first search of an improvement, which uses feedback information to generate solutions to help
Algorithm
- java 实现的一些算法： 赛选法求素数，最短路径（dijkstra，floyd），线段树，LCD，LCM-java implementation of a number of algorithms: tournament selection method Primes, the shortest path (dijkstra, floyd), segment tree, LCD, LCM
a
- 用JAVA实现A*的八宫算法，程序有点简单，有不好的地方请指正-With JAVA achieve A* algorithm for the eight palace, the program a bit simple, a bad place, please correct me
A-star---Eight-digital-problem
- 用A*算法解决八数码问题。由于实验要求，该八数码为5*2的格式，其中第一行最后一个方格为死格。-Artificial intelligence job with the A* algorithm to solve eight digital problem. Due to the experimental requirements, the eight digital 5* 2 format, the first line of the last checkered as dead cells.
A-Star
- A*算法，既是八向寻路算法，不是最优的，但和很快捷。 flash演示代码。-A* algorithm, both eight-routing algorithm is not optimal, but and very fast. flash demo code.
fire effect algorithm in javascript/html
- simulates a fire effect
A
- A*（A-Star)算法是一种静态路网中求解最短路最有效的方法,估价值与实际值越接近，估价函数取得就越好。该上传的内容是一个A*算法的模拟实现。-A* (A-Star) algorithm is the most effective way to short-circuit a static road network to solve the valuation closer to the actual value, the valuation function is achieved, the