Sciweavers

360 search results - page 30 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
UAI
1998
15 years 5 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
141
Voted
AINA
2009
IEEE
15 years 1 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
118
Voted
ICDCSW
2005
IEEE
15 years 9 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
Xiuqi Li, Jie Wu
117
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
A Comparative Study of the DNS Design with DHT-Based Alternatives
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
124
Voted
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni