Sciweavers

472 search results - page 17 / 95
» Design of Iterated Local Search Algorithms
Sort
View
AE
2003
Springer
15 years 1 months ago
ParaDisEO-Based Design of Parallel and Distributed Evolutionary Algorithms
ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
Sébastien Cahon, Nordine Melab, El-Ghazali ...
AAAI
2000
14 years 11 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
71
Voted
DCC
2006
IEEE
15 years 9 months ago
On Efficient Quantizer Design for Robust Distributed Source Coding
This paper considers the design of efficient quantizers for a distributed source coding system. The information is encoded at independent terminals and transmitted across separate...
Ankur Saxena, Jayanth Nayak, Kenneth Rose
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
15 years 3 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
15 years 3 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...