18 search results - page 3 / 4 » Heuristic Search Value Iteration for POMDPs |
AMAI
2004
Springer
14 years 6 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
HIPEAC
2010
Springer
14 years 3 months ago
2010
Springer
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
AAAI
1996
13 years 8 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
IEEEPACT
2009
IEEE
14 years 1 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...