1068 search results - page 101 / 214 » Extremely randomized trees |
153
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
112
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
131
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...
131
click to vote
PCI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...