-
-
-
Path_Planning.rar
Online UAV path planning including online planning schedule, splane smoothing algorithm and QPSO algorithm
-
P4.rar
IA algorithm, path finding for colaborative agents, interact for look for something.
-
-
netlink_2.6.x.zip
netlink sample for arm linux under 2.6.x, to use it, just download and modify you cross compiler path
-
ant.wsn.zip
... uses artificial ant agents that recolects data from all sensor nodes of the network. Every ants fuzes data from a node and sends it to every other sensor and then to the base station. All ants look for a way to go where there is an energy eficient path.
-
pso.rar
Unzip and copy the files to a folder (directory).
-Add the path to Matlab. (File>Set Path>Add with Subfolders)
-Read help for get_psoOptions.m and pso.m (enter help get_psoOptions at command line)
-
spfa_algorithm_fengzee.rar
最短路径 之 SPFA算法 作者:fengzee 日期:2008-02-15
SPFA——Shortest Path Faster Algorithm，它可以在O(kE)的时间复杂度内求出源点到其他所有点的最短路径，可以处理负边。SPFA的实现甚至比Dijkstra或者Bellman_Ford还要简单……
-
TracertMap.zip
This utility geo-locates the IP addresses on the path of a network packet in an IP network and displays them on a map.
//Use Maxmind s Getloaction
NodeInfo.LocationService = new Maxmind.NodeInfoLookupService()
//Use HostIP.info s ...
-
poj.rar
... 边的数量2<=t<=100(每条边可以重复遍历)
算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ])
l 表示的是2的指数，假设 i 到 k 要途径 ... 节点个数，(aXb)表示a行b列的矩阵一个 ，那么（1Xm）* path[ l ](mXm) 。
最终复杂度为O（t^3logn）
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
