2796 search results - page 133 / 560 » The coolest path problem |
119
Voted
COLT
2000
Springer
15 years 9 months ago
2000
Springer
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process ( ¢¡¤£¦¥§ ), and focus on gradient ascent approache...
119
Voted
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
191
click to vote
COMGEO
2006
ACM
15 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
147
Voted
EOR
2007
15 years 5 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
138
click to vote
IPCCC
2007
IEEE
15 years 11 months ago
2007
IEEE
Multimedia streaming applications can significantly boost the value of mobile ad hoc networks (MANET). Live streaming, however, means continuous data delivery, which is a major c...