696 search results - page 77 / 140 » Planning for Network-Aware Paths |
160
Voted
RSS
2007
15 years 5 months ago
2007
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
144
click to vote
AAAI
1996
15 years 5 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
161
click to vote
W2GIS
2004
Springer
15 years 9 months 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...
198
click to vote
SOICT
2010
14 years 10 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
123
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...