Sciweavers

4488 search results - page 126 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
145
Voted
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 7 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
112
Voted
ANOR
2002
99views more  ANOR 2002»
15 years 3 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...
147
Voted
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
15 years 9 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora
104
Voted
CP
2006
Springer
15 years 7 months ago
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
Jean-Philippe Hamiez, Jin-Kao Hao
JMLR
2006
145views more  JMLR 2006»
15 years 3 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street