2796 search results - page 132 / 560 » The coolest path problem |
137
click to vote
ORL
2008
15 years 5 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
190
click to vote
WEA
2010
Springer
15 years 12 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
134
click to vote
TACAS
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequen...
136
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
- The performance of monocular vision based target tracking is a strong function of camera motion. Without motion, the target estimation problem is unsolvable. By designing the cam...
134
Voted
ICN
2001
Springer
15 years 9 months ago
2001
Springer
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...