1068 search results - page 88 / 214 » Extremely randomized trees |
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
CG
2006
Springer
14 years 1 months ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
AIIDE
2008
14 years 9 days ago
2008
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
COMBINATORICA
2007
13 years 10 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
CG
2005
Springer
13 years 10 months ago
2005
Springer
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...