Sciweavers

2986 search results - page 558 / 598
» Utilizing Heterogeneous Networks in Distributed Parallel Com...
Sort
View
SPAA
1996
ACM
15 years 6 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SIGECOM
2005
ACM
98views ECommerce» more  SIGECOM 2005»
15 years 7 months ago
Hidden-action in multi-hop routing
In multi-hop networks, the actions taken by individual intermediate nodes are typically hidden from the communicating endpoints; all the endpoints can observe is whether or not th...
Michal Feldman, John Chuang, Ion Stoica, Scott She...
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 2 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
CONCUR
2004
Springer
15 years 7 months ago
Open Maps, Alternating Simulations and Control Synthesis
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
Paulo Tabuada
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 6 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....