Sciweavers

1055 search results - page 142 / 211
» Enumerations in computable structure theory
Sort
View
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
14 years 1 months ago
Properties of symmetric fitness functions
The properties of symmetric fitness functions are investigated. We show that a well-known encoding scheme inducing symmetric functions has the non-synonymous property and the sear...
Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon
ACL
2004
13 years 11 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICFP
2010
ACM
13 years 11 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
NN
2008
Springer
169views Neural Networks» more  NN 2008»
13 years 10 months ago
Modeling a flexible representation machinery of human concept learning
dely acknowledged that categorically organized abstract knowledge plays a significant role in high-order human cognition. Yet, there are many unknown issues about the nature of ho...
Toshihiko Matsuka, Yasuaki Sakamoto, Arieta Chouch...