84 search results - page 8 / 17 » A Step Forward in Studying the Compact Genetic Algorithm |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
NIPS
2003
13 years 10 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
BMCBI
2011
13 years 3 months ago
2011
Background: Illumina’s Infinium SNP BeadChips are extensively used in both small and large-scale genetic studies. A fundamental step in any analysis is the processing of raw all...
COR
2008
2008
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
13 years 8 months ago
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatica...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...