Sciweavers

229 search results - page 7 / 46
» Structure and Performance of Fine-Grain Parallelism in Genet...
Sort
View
PPSN
1998
Springer
14 years 2 days ago
Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
Shigeyoshi Tsutsui
INFOCOM
2006
IEEE
14 years 1 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
13 years 11 months 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
GECCO
2003
Springer
14 years 1 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
IJIT
2004
13 years 9 months ago
Genetic Algorithm for Feature Subset Selection with Exploitation of Feature Correlations from Continuous Wavelet Transform: a re
A genetic algorithm (GA) based feature subset selection algorithm is proposed in which the correlation structure of the features is exploited. The subset of features is validated a...
Gert Van Dijck, Marc M. Van Hulle, M. Wevers