1310 search results - page 78 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
163
click to vote
UPP
2004
Springer
15 years 3 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
141
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...