Sciweavers

1068 search results - page 117 / 214
» Extremely randomized trees
Sort
View
ICES
2001
Springer
78views Hardware» more  ICES 2001»
14 years 2 months ago
Embryonics: Artificial Cells Driven by Artificial DNA
Abstract. Embryonics is a long-term research project attempting to draw inspiration from the biological process of ontogeny, to implement novel digital computing machines endowed w...
Lucian Prodan, Gianluca Tempesti, Daniel Mange, An...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
14 years 2 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
VLDB
1994
ACM
153views Database» more  VLDB 1994»
14 years 2 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
COMPGEOM
1990
ACM
14 years 2 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
EUROPAR
2009
Springer
14 years 4 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity