Sciweavers

1813 search results - page 3 / 363
» Instance Pruning Techniques
Sort
View
ICTAI
2010
IEEE
13 years 8 months ago
Combining Learning Techniques for Classical Planning: Macro-operators and Entanglements
Planning techniques recorded a significant progress during recent years. However, many planning problems remain still hard even for modern planners. One of the most promising appro...
Lukás Chrpa
CPAIOR
2008
Springer
14 years 19 days ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...
JAIR
1998
92views more  JAIR 1998»
13 years 10 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
AAAI
2000
14 years 6 days ago
On Pruning Techniques for Multi-Player Games
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
Nathan R. Sturtevant, Richard E. Korf
CP
2009
Springer
13 years 8 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey