Sciweavers

498 search results - page 33 / 100
» Optimization of Genetic Operators for Scheduling Problems
Sort
View
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 5 months ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...
RECOMB
2003
Springer
16 years 3 days ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
ICGA
1993
145views Optimization» more  ICGA 1993»
15 years 1 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
COR
2010
129views more  COR 2010»
14 years 10 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
15 years 5 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman