Sciweavers

1563 search results - page 49 / 313
» Performance comparison of memetic algorithms
Sort
View
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 9 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 14 days ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
WSC
1998
13 years 10 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
ISMIR
2004
Springer
133views Music» more  ISMIR 2004»
14 years 2 months ago
Understanding Search Performance in Query-by-Humming Systems
Previous work in Query-by-Humming systems has left open many questions. Although a variety of techniques have been explored, there has been relatively little work to compare them ...
Roger B. Dannenberg, Ning Hu
EUROGP
2007
Springer
143views Optimization» more  EUROGP 2007»
14 years 21 days ago
Confidence Intervals for Computational Effort Comparisons
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
Matthew Walker, Howard Edwards, Chris H. Messom