Sciweavers

883 search results - page 43 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
DAGSTUHL
2006
13 years 9 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
14 years 24 days ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 7 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
GECCO
2003
Springer
106views Optimization» more  GECCO 2003»
14 years 24 days ago
Taming a Flood with a T-CUP - Designing Flood-Control Structures with a Genetic Algorithm
This paper describes the use of a genetic algorithm to solve a hydrology design problem - determining an optimal or near-optimal prescription of Best Management Practices in a flo...
Jeff Wallace, Sushil J. Louis
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 7 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...