476 search results - page 10 / 96 » Representation dependence testing using program inversion |
AAAI
1992
13 years 8 months ago
1992
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
BMCBI
2007
13 years 7 months ago
2007
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
PPSN
1994
Springer
13 years 11 months ago
1994
Springer
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
FLAIRS
2006
13 years 9 months ago
2006
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
MPC
2010
Springer
14 years 12 days ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...