2294 search results - page 212 / 459 » From Path Graphs to Directed Path Graphs |
111
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— This paper provides proof-of-concept that stateof-the-art sampling-based motion planners that are tightly integrated with a physics-based simulator can compute paths th...
138
click to vote
IWDC
2005
Springer
15 years 8 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
127
Voted
GD
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
138
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
96
Voted
RSA
2006
15 years 2 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...