Sciweavers

13987 search results - page 545 / 2798
» The Two Guards Problem
Sort
View
AAAI
2000
15 years 8 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
AAAI
1998
15 years 8 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
CCCG
1994
15 years 8 months ago
Widest Empty Corridor with Multiple Links and Right-angle Turns
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
Siu-Wing Cheng
AIPS
2009
15 years 8 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner
ICASSP
2010
IEEE
15 years 7 months ago
Iterated smoothing for accelerated gradient convex minimization in signal processing
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
Tobias Lindstrøm Jensen, Jan Østerga...