2266 search results - page 123 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
114
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Sequence alignments form part of many investigations in molecular biology, including the determination of phylogenetic relationships, the prediction of protein structu...
102
Voted
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
194
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
124
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
108
click to vote
ICANNGA
2007
Springer
15 years 7 months ago
2007
Springer
A new evolutionary-progressive method for Multiple Sequence Alignment problem is proposed. The method efficiently combines flexibility of evolutionary approach with speed and accu...