639 search results - page 32 / 128 » Comparative analysis of genetic algorithm implementations |
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
BMCBI
2004
13 years 8 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
CISIS
2008
IEEE
14 years 3 months ago
2008
IEEE
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
TAINN
2005
Springer
14 years 2 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...