78 search results - page 11 / 16 » A comparison of empirical and model-driven optimization |
AI
1998
Springer
14 years 9 months ago
1998
Springer
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
101
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Evolutionary algorithms applied in real domain should profit from information about the local fitness function curvature. This paper presents an initial study of an evolutionary...
TSMC
2002
14 years 9 months ago
2002
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
65
Voted
CP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
EUROSYS
2007
ACM
15 years 6 months ago
2007
ACM
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...