86 search results - page 5 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
AAAI
2010
13 years 5 months ago
2010
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
AAAI
2000
13 years 9 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...
FLAIRS
2007
13 years 10 months ago
2007
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
IJCAI
2007
13 years 9 months ago
2007
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...