2796 search results - page 196 / 560 » The coolest path problem |
135
click to vote
ICRA
2007
IEEE
16 years 26 days ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
174
click to vote
EEMMAS
2007
Springer
16 years 21 days ago
2007
Springer
Behind the curtains at check-in desks in airports hide some of the most complex material handling systems, which manage to get your bag transported to the correct departure gate of...
148
click to vote
MLDM
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...
148
click to vote
ICMCS
2006
IEEE
16 years 17 days ago
2006
IEEE
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
108
click to vote
ICRA
2006
IEEE
16 years 17 days ago
2006
IEEE
— This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also a...