搜索：paths
找到约 21 项符合「paths」的查询结果
结果 21
按分类筛选
https://www.eeworm.com/dl/534/425105.html
其他
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a
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. Given such a graph as input, y ...
https://www.eeworm.com/dl/647/478075.html
嵌入式/单片机编程
The software and hardware development fields evolved along separate paths through the end of the 20t
The software and hardware development fields evolved along separate paths through the end of the 20th century. We seem to have come full circle, however. The previously rigid hardware on which our programs run is softening in many ways. Embedded systems are largely responsible fo ...
https://www.eeworm.com/dl/628/425099.html
编译器/解释器
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to dete ...
https://www.eeworm.com/dl/534/465758.html
其他
function [r_path, r_cost] = dijkstra(pathS, pathE, transmat) The Dijkstra s algorithm, Implemente
function [r_path, r_cost] = dijkstra(pathS, pathE, transmat)
The Dijkstra s algorithm, Implemented by Yi Wang, 2005
This version support detecting _cyclic-paths_
https://www.eeworm.com/dl/653/146024.html
嵌入式Linux
嵌入式文件系统ucfs.zip This project should serve as an "easy start" with /FS. All paths are relative to t
嵌入式文件系统ucfs.zip
This project should serve as an "easy start" with /FS.
All paths are relative to the project file. You should
therefore be able to copy the entire directory (including
all subdirectories) to any location on your harddrive.
https://www.eeworm.com/dl/637/209193.html
多国语言处理
k Shortest Paths David Eppstein s method ICTCLAS研究学习组 http://groups.google.com/group/ictclas?ms
k Shortest Paths
David Eppstein s method
ICTCLAS研究学习组
http://groups.google.com/group/ictclas?msg=subscribe
https://www.eeworm.com/dl/684/194398.html
软件设计/软件工程
单源点最短路径算法的设计与实现 算法 SHORTEST-PATHS求出了v0至其它各结点的最短路径
单源点最短路径算法的设计与实现
算法 SHORTEST-PATHS求出了v0至其它各结点的最短路径，但是没有给出这些最短路径。补充该算法，使新算法在找出这些最短路径长度的同时，也能求出路径上的结点序列。
https://www.eeworm.com/dl/542/129925.html
其他书籍
Mobile robot tracking of pre-planned paths是国外顶尖级专家篆写的有关机器人路径规划的文章。虽然是2000年的
Mobile robot tracking of pre-planned paths是国外顶尖级专家篆写的有关机器人路径规划的文章。虽然是2000年的，但是很有价值。
https://www.eeworm.com/dl/532/260235.html
书籍源码
Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：d
Floyd-Warshall算法描述
1)适用范围：
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束：dis即为所有点对的最 ...
https://www.eeworm.com/dl/522019.html
书籍
Multiple-Input+Multiple-Output+Channel+Models
Many wireless communications channels consist of multiple signal paths from the
transmitter to receiver. This multiplicity of paths leads to a phenomenon known
as multipath fading. The multiple paths are caused by the presence of objects in the
physical environment that, through ...