26 search results - page 1 / 6 » Boosting Complete Techniques Thanks to Local Search Methods |
AMAI
1998
Springer
13 years 5 months ago
1998
Springer
AAAI
2006
13 years 6 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
ANOR
2004
13 years 5 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
AAAI
2004
13 years 6 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...