Sciweavers

30 search results - page 5 / 6
» An Adaptive Particle Swarm Optimizer Using Balanced Explorat...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 1 months ago
Advanced models of cellular genetic algorithms evaluated on SAT
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Enrique Alba, Hugo Alfonso, Bernabé Dorrons...
COLT
2008
Springer
13 years 9 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 8 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 5 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman