1068 search results - page 95 / 214 » Extremely randomized trees |
EPEW
2005
Springer
14 years 3 months ago
2005
Springer
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infini...
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
JIRS
2010
13 years 8 months ago
2010
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
WSC
2001
13 years 11 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Ensemble methods are able to improve the predictive performance of many base classifiers. Up till now, they have been applied to classifiers that predict a single target ...