Sciweavers

69 search results - page 1 / 14
» Generic Incremental Algorithms for Local Search
Sort
View
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 4 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
CP
2005
Springer
13 years 10 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson
INFOSCALE
2007
ACM
13 years 6 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, ...
CEC
2007
IEEE
13 years 11 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
13 years 10 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...