Sciweavers

1503 search results - page 84 / 301
» Self-optimizing distributed trees
Sort
View
ALT
2010
Springer
13 years 11 months ago
Lower Bounds on Learning Random Structures with Statistical Queries
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
Dana Angluin, David Eisenstat, Leonid Kontorovich,...
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
14 years 4 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde
ECRTS
2007
IEEE
14 years 4 months ago
Composition Techniques for Tree Communication Schedules
A critical resource in a distributed real-time system is its shared communication medium. Unrestrained concurrent access to the network can lead to collisions that reduce the syst...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
EUROMICRO
2007
IEEE
14 years 4 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
IPPS
2007
IEEE
14 years 4 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert