1068 search results - page 61 / 214 » Extremely randomized trees |
EWSN
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, thr...
ISCAS
2003
IEEE
14 years 2 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
DAC
1995
ACM
14 years 9 days ago
1995
ACM
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
AAAI
1994
13 years 10 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...