53 search results - page 2 / 11 » Greedy, genetic, and greedy genetic algorithms for the quadr... |
INFORMATICALT
2000
13 years 4 months ago
2000
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
JACM
2002
13 years 4 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
CEC
2005
IEEE
13 years 7 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...