Results 271 to 280 of about 794,304 (306)
Some of the next articles are maybe not open access.
Control Abstractions for Local Search
Constraints, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pascal Van Hentenryck, Laurent Michel
openaire +1 more source
2006
The Local Search algorithm is one of the simplest heuristic algothms for solving the MAX-SAT problem. The goal of this paper is to estimate the relative error produced by this algorithm being applied to random 3-CNFs with fixed density $\varrho$. We prove that, for any $\varrho$, there is a constant c such that a weakened version of Local Search that ...
Andrei A. Bulatov, Evgeny S. Skvortsov
openaire +1 more source
The Local Search algorithm is one of the simplest heuristic algothms for solving the MAX-SAT problem. The goal of this paper is to estimate the relative error produced by this algorithm being applied to random 3-CNFs with fixed density $\varrho$. We prove that, for any $\varrho$, there is a constant c such that a weakened version of Local Search that ...
Andrei A. Bulatov, Evgeny S. Skvortsov
openaire +1 more source
2003
This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties : it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure.
openaire +1 more source
This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties : it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure.
openaire +1 more source
Selection of initial solutions for local search in multiobjective genetic local search
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2003In multiobjective genetic local search (MOGLS) algorithms, the local search is usually applied to all offsprings generated by genetic operations. This paper proposes an idea of selecting only good offsprings as initial solutions for the local search.
Hisao Ishibuchi +2 more
openaire +1 more source
Complex valued cuckoo search with local search
2013 Ninth International Conference on Natural Computation (ICNC), 2013Aiming at eliminating the defects of slow search speed and low accuracy of cuckoo search for function optimization, the paper proposed a complex-valued cuckoo search algorithm with local search. The results of function testing show that the improved algorithm has better performance and it can do well in high dimensional optimization.
Rui-min Jia, Deng-xu He
openaire +1 more source
Theoretical Aspects of Local Search
2007Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation ...
Michiels, W.P.A.J. +2 more
openaire +2 more sources
Iterated local search for microaggregation
Journal of Systems and Software, 2015Our paper presents a microaggregation method to prevent disclosure of sensitive data.We define a local search method that monotonically improves solution quality while preserving feasibility.We employ local search in an iterated local search heuristic.Our method consistently identifies better quality solutions than all extant methods on benchmark ...
Laszlo, Michael J, Mukherjee, Sumitra
openaire +2 more sources
Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
2006A popular approach in the design of evolutionary algorithms is to integrate local search into the random search process. These so-called memetic algorithms have demonstrated their efficiency in countless applications covering a wide area of practical problems.
openaire +1 more source