1068 search results - page 60 / 214 » Extremely randomized trees |
157
click to vote
OPODIS
2004
15 years 7 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
152
click to vote
ICDCN
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
136
Voted
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
171
click to vote
CIAC
2010
Springer
16 years 2 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
148
click to vote
SIGECOM
2009
ACM
16 years 1 days ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...