589 search results - page 30 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
111
Voted
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
138
click to vote
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
95
Voted
IIS
2004
15 years 3 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
102
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
129
click to vote
IJCAI
2003
15 years 3 months ago
2003
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...