882 search results - page 23 / 177 » Local Search for Very Large SAT Problems |
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
87
Voted
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
109
click to vote
CADE
2011
Springer
13 years 11 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...