51 search results - page 5 / 11 » Local search algorithms on the Stable Marriage Problem: Expe... |
SLS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
SAT
2004
Springer
14 years 27 days ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
JSAT
2010
13 years 2 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
AAAI
2006
13 years 9 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...