Sciweavers

5966 search results - page 668 / 1194
» Distributed Caching Algorithms for Content Distribution Netw...
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
16 years 4 days ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
SIGCOMM
2000
ACM
15 years 11 months ago
FIRE: Flexible intra-AS routing environment
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
Craig Partridge, Alex C. Snoeren, W. Timothy Stray...
168
Voted
ICPP
1990
IEEE
15 years 11 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin
AI
2007
Springer
16 years 1 months ago
Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
Changhe Yuan, Marek J. Druzdzel
182
Voted
IPPS
2005
IEEE
16 years 13 days ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou