1683 search results - page 39 / 337 » Local Selection |
CP
2008
Springer
13 years 11 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
ISCAS
2008
IEEE
14 years 3 months ago
2008
IEEE
— We study the problem of automatic musical beat tracking from acoustic data, i.e., finding locations of beats of a music piece by computers on-the-fly, in this work. An online...
ICNSC
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper presents an approach to the multiple sequence alignment (MSA) problem by applying genetic algorithms with a reserve selection mechanism. MSA is one of the most funda...
DEXAW
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
AE
1999
Springer
14 years 1 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...