1813 search results - page 3 / 363 » Instance Pruning Techniques |
155
Voted
ICTAI
2010
IEEE
15 years 25 days ago
2010
IEEE
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...
139
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
114
Voted
JAIR
1998
15 years 3 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
93
Voted
AAAI
2000
15 years 4 months ago
2000
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...
125
Voted
CP
2009
Springer
15 years 1 months ago
2009
Springer
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...