Sciweavers

1866 search results - page 352 / 374
» A graph-theoretic approach to distributed control over netwo...
Sort
View
PODC
2004
ACM
14 years 2 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
INFOCOM
2006
IEEE
14 years 2 months ago
AnySee: Peer-to-Peer Live Streaming
— Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end de...
Xiaofei Liao, Hai Jin, Yunhao Liu, Lionel M. Ni, D...
ICPP
1998
IEEE
14 years 1 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
SPAA
1997
ACM
14 years 28 days ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
CP
2006
Springer
14 years 14 days ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...