1099 search results - page 64 / 220 » On the Complexity of Computing Evolutionary Trees |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
EH
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper discusses the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of ...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...