搜索资源列表
Ad-hoc
- A major issue with ad-hoc networks is energy consumption since nodes are usually mobile and battery-operated. In this project we compared the performance of ad-hoc routing protocols in a network where each participating mobile node has a given
Path
- 用vc++写的机器人路径规划仿真平台的程序，修改了几次，终于搞定了-Written using vc++ simulation platform for robot path planning process, modified several times, finally Gaoding the
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
path
- 分解路径，分解每一个文件夹得名称是一个文档，可复制粘贴-Path decomposition,decomposition of each was the name of a folder is a document,can copy and paste
ceshiCPU
- NCS处理器中微程序控制器的设计方法，介绍了微程序控制器的基本构成电路和工作特点；在设计中采用了诸如：多入口地址输入、内外码转换、封锁机制等提高控制器性能的方法，并确定了电路的工作时钟、数据通路和控制通路。最后指出成功的微程序控制器设计是设计高性能CPU的关键。-NCS processor micro-controller design method, introduced micro-program controller circuit and the basic characteristic
max_flow
- 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm,
AntVCprograms
- 蚁群算法VC源代码，很完善的程序，适用于机器人路径规划。-VC source code for ant colony algorithm, it is well-established procedures for robot path planning.
MANIK
- MANIK is a 32 bit RISC Microprocessor. The salient features of the processor are listed below. Features Hardware Features • Data Path Width 32 bits, with Four stage pipeline. • Mixed 16/32 bit instructions for code density ̶
ant
- 蚁群算法最短路径通用Matlab程序。蚁群算法动态寻路算法。-Ant colony algorithm for the shortest path generic Matlab program. Ant colony algorithm for dynamic pathfinding algorithm.
matlabCode
- floyd最短路算法、dijkstra最短路算法、求网络的最小费用最大流-floyd shortest path algorithm, dijkstra shortest path algorithm, find the minimum cost maximum flow networks
path
- 两点之间的简单路径 数据结构课程设计，c++描述-A simple path between two points
aomdv
- wireless routing protocol implement on ns2,扩展aodv路由协议成为多路径路由协议-wireless routing protocol implement on ns2, extended aodv routing protocol as multi-path routing protocol
multipal-path
- 多通道数据采集程序,实现多个通道的数据采集，很有用-multipal path labview
articles-about-path-planning(written-in-chines).r
- many articles about path planning .the research object is aircraft .the main algorithem is SAS(sparse A star).and have a paper to explain how to write the code of SAS
project-Critical-path
- 适用于Microsoft Project 的VBA，对于给定网络图计算关键路径-For Microsoft Project, VBA, the calculation of critical path for a given network diagram
Software-Architect-growth-path
- 软件架构师成长之路. Software Architect growth path -Software Architect growth path. The way to Software Architect.
Genetic-algorithm-for-optimal-path
- 改进遗传算法求解CVRP的程序（车辆路径问题） VC++环境下编码-Genetic algorithm for optimal path
mapxPvc-shortest-path
- 在给定地图中寻找两点最短路径，在VC++环境编译通过！-Given map to find the shortest path in VC++ and compiled by
path环境变量误删
- 不小心误删了path环境变量后肯定很麻烦，这里提供一种补救方式！(Restore path environment variables)