Sciweavers

158 search results - page 7 / 32
» Local search for distributed asymmetric optimization
Sort
View
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
14 years 1 months ago
Hybrid multiobjective genetic algorithm with a new adaptive local search process
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
Salem F. Adra, Ian Griffin, Peter J. Fleming
AI
1999
Springer
13 years 7 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
INFOSCALE
2007
ACM
13 years 9 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...
ECAI
2006
Springer
13 years 11 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
ATAL
2006
Springer
13 years 11 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo