137 search results - page 22 / 28 » An Improved Integer Local Search for Complex Scheduling Prob... |
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
IEEEPACT
2007
IEEE
14 years 2 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...