78 search results - page 4 / 16 » Heavy-Tailed Distributions in Combinatorial Search |
ANOR
2004
13 years 8 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...
ICEC
1994
13 years 10 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
AI
2003
Springer
14 years 1 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...