279 search results - page 29 / 56 » Reduction approaches for robust shortest path problems |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
104
click to vote
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
BMVC
2010
14 years 7 months ago
2010
We present a novel method to detect curves with unknown endpoints using minimal path techniques. Our work builds on the state of the art minimal path techniques currently used to ...