1813 search results - page 83 / 363 » Instance Pruning Techniques |
129
click to vote
IJCAI
2007
15 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
132
click to vote
AAAI
2000
15 years 6 months ago
2000
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
140
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
110
click to vote
AIR
2000
15 years 4 months ago
2000
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because p...
156
click to vote
CADE
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...