1878 search results - page 271 / 376 » Feature Generation Using General Constructor Functions |
134
click to vote
CN
1999
15 years 1 months ago
1999
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
106
click to vote
AAAI
2010
15 years 9 days ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
113
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
119
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
It has long been observed that database management systems focus on traditional business applications, and that few people use a database management system outside their workplace...
164
click to vote
EUROGP
1998
Springer
15 years 6 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...