32 search results - page 1 / 7 » Average-Case Complexity of Shortest-Paths Problems in the Ve... |
RANDOM
1997
Springer
13 years 11 months ago
1997
Springer
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
CPAIOR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
W2GIS
2004
Springer
14 years 7 days ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...