Sciweavers

641 search results - page 51 / 129
» Program Comprehension as a Learning Process
Sort
View
PAMI
2011
13 years 2 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
14 years 1 months ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
FLAIRS
2008
13 years 10 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon
NIPS
1993
13 years 9 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...