Sciweavers

14774 search results - page 8 / 2955
» Computational complexity and evolutionary computation
Sort
View
66
Voted
FUIN
1998
122views more  FUIN 1998»
14 years 9 months ago
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
Günter Rudolph
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
15 years 1 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
AAAI
2006
14 years 11 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
ICAC
2009
IEEE
15 years 4 months ago
Applying genetic algorithms to decision making in autonomic computing systems
Increasingly, applications need to be able to self-reconfigure in response to changing requirements and environmental conditions. Autonomic computing has been proposed as a means...
Andres J. Ramirez, David B. Knoester, Betty H. C. ...
KES
2008
Springer
14 years 9 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada