53 search results - page 4 / 11 » Greedy, genetic, and greedy genetic algorithms for the quadr... |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
GECCO
2007
Springer
14 years 1 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]....
IRREGULAR
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
RECOMB
2003
Springer
14 years 7 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
EVOW
2005
Springer
14 years 1 months ago
2005
Springer
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...