Sciweavers

501 search results - page 70 / 101
» Scheduling Abstractions for Local Search
Sort
View
CEC
2010
IEEE
13 years 9 months ago
Elitist Artificial Bee Colony for constrained real-parameter optimization
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
Efrén Mezura-Montes, Ramiro Ernesto Velez-K...
TCBB
2008
107views more  TCBB 2008»
13 years 8 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
ANOR
2002
99views more  ANOR 2002»
13 years 8 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
Tanumay Datta, N. Srinidhi, Ananthanarayanan Chock...
AISB
1994
Springer
14 years 17 days ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry