895 search results - page 106 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
PRL
2008
14 years 11 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
134
click to vote
EVOW
1999
Springer
15 years 3 months ago
1999
Springer
A technique is proposed to reduce the peak power consumption of sequential circuits during test pattern application. High-speed computation intensive VLSI systems, as telecommunica...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...