Sciweavers

850 search results - page 94 / 170
» heuristics 2006
Sort
View
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 2 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 2 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 2 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 2 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 2 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon