Sciweavers

3247 search results - page 236 / 650
» Randomized smoothing networks
Sort
View
168
Voted
AINA
2007
IEEE
16 years 4 days ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
MINENET
2006
ACM
15 years 11 months ago
SVM learning of IP address structure for latency prediction
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
Robert Beverly, Karen R. Sollins, Arthur Berger
MIDDLEWARE
2005
Springer
15 years 11 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
AAAI
2008
15 years 8 months ago
Exploiting Causal Independence Using Weighted Model Counting
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
Wei Li 0002, Pascal Poupart, Peter van Beek
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
15 years 5 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach