2796 search results - page 125 / 560 » The coolest path problem |
148
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
137
Voted
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
161
click to vote
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
148
click to vote
IJRR
2008
15 years 5 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
146
click to vote
APNOMS
2009
Springer
15 years 11 months ago
2009
Springer
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...