1529 search results - page 21 / 306 » Search Space Analysis of the Linear Ordering Problem |
SIAMJO
2008
13 years 7 months ago
2008
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
AIPS
2010
13 years 7 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
AIPS
2006
13 years 9 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
ACST
2006
13 years 9 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
14 years 1 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...