Sciweavers

1503 search results - page 9 / 301
» Self-optimizing distributed trees
Sort
View
85
Voted
HYBRID
2009
Springer
15 years 6 months ago
Distributed Tree Rearrangements for Reachability and Robust Connectivity
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
Michael Schuresko, Jorge Cortés
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
15 years 3 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...
119
Voted
WWW
2011
ACM
14 years 6 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
WOSP
2004
ACM
15 years 5 months ago
Computing the performability of layered distributed systems with a management architecture
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
Olivia Das, C. Murray Woodside
JMLR
2010
149views more  JMLR 2010»
14 years 6 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel