Sciweavers

1628 search results - page 19 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 4 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
PC
2000
100views Management» more  PC 2000»
14 years 10 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
SAC
2004
ACM
15 years 4 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
15 years 3 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
PPSN
2004
Springer
15 years 4 months ago
Hierarchical Genetic Algorithms
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
Edwin D. de Jong, Dirk Thierens, Richard A. Watson