Sciweavers

AAAI
2000
13 years 5 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang
IJCAI
2003
13 years 5 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
ESANN
2006
13 years 5 months ago
Diversity creation in local search for the evolution of neural network ensembles
Abstract. The EENCL algorithm [1] automatically designs neural network ensembles for classification, combining global evolution with local search based on gradient descent. Two mec...
Pete Duell, Iris Fermin, Xin Yao
FLAIRS
2004
13 years 5 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
ASC
2006
13 years 5 months ago
Simulation-based optimisation using local search and neural network metamodels
This paper presents a new algorithm for enhancing the efficiency of simulation-based optimisation using local search and neural network metamodels. The local search strategy is ba...
Anna Persson, Henrik Grimm, Amos Ng
AAAI
2004
13 years 5 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
AAAI
2004
13 years 5 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
IJCAI
2007
13 years 5 months ago
Building Structure into Local Search for SAT
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
Duc Nghia Pham, John Thornton, Abdul Sattar
DATESO
2007
107views Database» more  DATESO 2007»
13 years 5 months ago
Work with Knowledge on the Internet - Local Search
Authors are looking within their research grant new original web local search algorithm respecting specifics of Czech national environment. We would like to initiate further debate...
Antonin Pavlicek, Josef Muknsnabl
EVOW
2008
Springer
13 years 6 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...