720 search results - page 76 / 144 » Linear k-arboricities on trees |
CG
2006
Springer
13 years 10 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
DAGSTUHL
2007
13 years 10 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
ICMLA
2007
13 years 10 months ago
2007
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
NIPS
2003
13 years 10 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
WSCG
2003
13 years 10 months ago
2003
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...