112 search results - page 11 / 23 » Computational Complexity, Genetic Programming, and Implicati... |
ICCBR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
AC
1998
Springer
13 years 8 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
GECCO
2007
Springer
14 years 9 days ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
BMCBI
2008
13 years 8 months ago
2008
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...