Sciweavers

1376 search results - page 81 / 276
» Searching Trees: An Essay
Sort
View
AAAI
1998
15 years 1 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
CP
2009
Springer
16 years 16 days ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
SAC
2009
ACM
15 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
ECAI
2004
Springer
15 years 5 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
CG
2004
Springer
15 years 5 months ago
Searching over Metapositions in Kriegspiel
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player h...
Andrea Bolognesi, Paolo Ciancarini