2796 search results - page 304 / 560 » The coolest path problem |
141
click to vote
ICRA
1995
IEEE
15 years 10 months ago
1995
IEEE
The control of nonholonomic and underactuated systems with symmetry is illustrated by the problem of controlling a bicycle. We derive a controller which, using steering and rear-w...
129
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
We address the problem of finding indirect overlay paths that reduce the latency between pairs of nodes in an overlay. To this end we propose to rely on an Internet Coordinate Sys...
167
click to vote
FPL
2007
Springer
15 years 8 months ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...
201
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
169
click to vote
AAAI
1990
15 years 7 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...