104 search results - page 4 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
WIA
2009
Springer
14 years 1 days ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
EUROCAST
2009
Springer
14 years 1 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ICANNGA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
INFOCOM
2009
IEEE
14 years 3 days ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...