Sciweavers

677 search results - page 92 / 136
» Rigorous Object-Oriented Analysis
Sort
View
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 2 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
IJCAI
2003
13 years 10 months ago
Gaussian Process Models of Spatial Aggregation Algorithms
Multi-level spatial aggregates are important for data mining in a variety of scientific and engineering applications, from analysis of weather data (aggregating temperature and p...
Naren Ramakrishnan, Christopher Bailey-Kellogg
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...
IJBC
2006
93views more  IJBC 2006»
13 years 8 months ago
Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems
In recent years, a large amount of work on chaos-based cryptosystems have been published. However many of the proposed schemes fail to explain or do not possess a number of featur...
Gonzalo Álvarez, Shujun Li
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 5 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao