Sciweavers

1413 search results - page 138 / 283
» A Theory for Memory-Based Learning
Sort
View
MFCS
2004
Springer
15 years 11 months ago
Approximating Boolean Functions by OBDDs
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...
Andre Gronemeier
GECCO
2003
Springer
118views Optimization» more  GECCO 2003»
15 years 11 months ago
Population Sizing Based on Landscape Feature
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...
Jian Zhang, Xiaohui Yuan, Bill P. Buckles
EMNLP
2008
15 years 7 months ago
A Graph-theoretic Model of Lexical Syntactic Acquisition
This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose...
Hinrich Schütze, Michael Walsh
ICANN
2010
Springer
15 years 7 months ago
Neuro-symbolic Representation of Logic Programs Defining Infinite Sets
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
Ekaterina Komendantskaya, Krysia Broda, Artur S. d...
ML
2006
ACM
143views Machine Learning» more  ML 2006»
15 years 6 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton