2266 search results - page 189 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
117
click to vote
CPM
2005
Springer
15 years 3 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A meta-GA (GA within a GA) is used to investigate evolving the parameter settings of genetic operators for genetic and evolutionary algorithms (GEA) in the hope of creating a self...
121
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
131
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
126
click to vote
SWAT
2000
Springer
15 years 5 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...