Sciweavers

1506 search results - page 36 / 302
» On the Distribution of Natural Probability Functions
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
EVOW
2004
Springer
14 years 1 months ago
On the Structure of Sequential Search: Beyond "No Free Lunch"
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
Thomas M. English
CSDA
2007
100views more  CSDA 2007»
13 years 7 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
EUROGP
2008
Springer
105views Optimization» more  EUROGP 2008»
13 years 9 months ago
A Linear Estimation-of-Distribution GP System
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
Riccardo Poli, Nicholas Freitag McPhee
ANLP
2000
106views more  ANLP 2000»
13 years 9 months ago
Exploiting auxiliary distributions in stochastic unification-based grammars
This paper describes a method for estimating conditional probability distributions over the parses of "unification-based" grammars which can utilize auxiliary distributi...
Mark Johnson, Stefan Riezler