3320 search results - page 144 / 664 » Heuristics for the Phylogeny Problem |
169
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
187
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
147
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...
155
click to vote
AISB
1995
Springer
15 years 10 months ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...