434 search results - page 12 / 87 » Constraint-Based Combinators for Local Search |
157
click to vote
GIS
2009
ACM
16 years 23 days ago
2009
ACM
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. Instead, ...
110
click to vote
SAT
2010
Springer
14 years 10 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
100
click to vote
KI
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
IAT
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
131
click to vote
GECCO
2008
Springer
15 years 23 days ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...