390 search results - page 43 / 78 » Computing shortest paths for any number of hops |
132
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
109
click to vote
COMGEO
2010
ACM
15 years 2 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
130
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
154
click to vote
CAPTECH
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
100
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— In label-switched networks such as MPLS, protection routing involves computing and setting up the backup paths at the same time when the primary paths are routed. It ha...