搜索资源列表
-
0下载：
It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu -It provides multiple routing (DHT) algori thms such as Chord, Kademlia, Koorde. Pastry and Tapestry. and a distribu
-
-
0下载：
如何找到一条最短的路径是程序员需要设计的算法，目前最为流行的寻路算法就是A*算法，这个就是A*算法的一个简单例子-How to find a shortest path is programmers need to design algorithms, is currently the most popular routing algorithm is the A* algorithm, this is the A* algorithm is a simple example
-
-
0下载：
主要应用于超大规模集成电路的布线算法，代码效率一般-Mainly used in VLSI routing algorithm, the code efficiency of the general
-
-
0下载：
Solving the Vehicle Routing Problem
with Genetic Algorithms
-
-
1下载：
模拟一台路由器使用距离向量算法更新路由表功能-Simulate a router using distance-vector algorithms update the routing table function
-
-
0下载：
在谈判阻塞算法在电路设计中的应用，该算法不断迭代直到不存在被使用一次以上的路由资源。在每一次迭代过程中，先删除每个线网，然后根据最小化成本函数的原则重新布线-Choking algorithm in the negotiations in the circuit design, the iterative algorithms have been used until there is no more than one routing resources. In each iteration,
-
-
0下载：
Network Routing Protocol using Genetic Algorithms
-
-
0下载：
the procedure is using genetic algorithms to solve vehicle routing
-
-
0下载：
计算机网络路由算法中的距离向量算法方法，这是源程序源码码，学计算机网络的应该都知道! 可直接使用。 已通过测试。
-Computer network routing algorithms in the distance vector algorithm method, which is the source code source code, school computer networks should all know that can be used directly. Has bee
-
-
0下载：
利用MATLAB 实现Floyd 算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。 用MATLAB 仿真工具实现Floyd 算法：给定图G 及其边(i , j )的权
wi , j (1≤i≤n ,1≤j≤n) ，求出其各个端点之间的最小距离以及路由。
-Floyd achieved using MATLAB algorithms for the shortest distance routing adjacency matri
-
-
0下载：
无线传感器网络分簇路由算法，很经典的，适合初学者练习使用-Clustering routing algorithms in wireless sensor networks, very classic, suitable for beginners to use
-
-
0下载：
1. To model and simulate OLSR & GRP routing protocols under varying number of nodes using OPNET Modeler14.5.
2. To compare and analyze the designed algorithms for high QoS parameters and recommend the optimal protocol.
-
-
0下载：
本源码通过C# GDI+ 编写。提供三种生成迷宫的算法（深度优先法，递归分割法，随机PRIM法），提供基于广度优先算法的迷宫自动寻径算法。迷宫大小、单元格大小、线粗均可自定义。优化了算法，递归改为栈实现，能够生成任意大地图而不会引起原来的函数递归栈溢出问题。生成迷宫后，支持键盘按键进行手动走迷宫。(The source code is written by C# GDI+. Three algorithms of maze generation (depth first, recursion s
-
-
1下载：
运用matlab语言实现OLSR路由算法中MPRs的选择(Implementation of MPRs Selection in OLSR Routing Algorithms by matlab)
-
