10054 search results - page 381 / 2011 » On the Complexity of Function Learning |
170
click to vote
BIBE
2001
IEEE
15 years 8 months ago
2001
IEEE
Effective analysis of genome sequences and associated functional data requires access to many different kinds of biological information. For example, when analysing gene expressio...
149
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
146
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
145
click to vote
KES
2008
Springer
15 years 4 months ago
2008
Springer
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
140
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...