5082 search results - page 591 / 1017 » Hierarchical Genetic Algorithms |
161
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
224
click to vote
CGO
2011
IEEE
14 years 10 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
186
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
169
click to vote
TCS
2008
15 years 6 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
200
click to vote
GECCO
2004
Springer
16 years 7 days ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...