1503 search results - page 93 / 301 » Self-optimizing distributed trees |
211
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
184
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
169
click to vote
ITIIS
2008
15 years 6 months ago
2008
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
181
click to vote
CPC
2004
15 years 6 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
155
Voted
ISMIR
2005
Springer
16 years 5 days ago
2005
Springer
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...