49 search results - page 5 / 10 » Characterizing a Tunably Difficult Problem in Genetic Progra... |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
ADVAI
2010
13 years 3 months ago
2010
The focus of warfare has shifted from the Industrial Age to the Information Age, as encapsulated by the term Network Enabled Capability. This emphasises information sharing, comma...
BMCBI
2006
13 years 8 months ago
2006
Background: The imprint of natural selection on gene sequences is often difficult to detect. A plethora of methods have been devised to detect genetic changes due to selective pro...
GECCO
2006
Springer
14 years 14 days ago
2006
Springer
Trading rules are widely used by practitioners as an effective means to mechanize aspects of their reasoning about stock price trends. However, due to the simplicity of these rule...
GECCO
2006
Springer
14 years 14 days ago
2006
Springer
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...