Sciweavers

3319 search results - page 568 / 664
» The topology of dark networks
Sort
View
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
ICN
2009
Springer
15 years 11 months ago
Trainspotting, a WSN-Based Train Integrity System
In contrast to classic train protection systems where most of the safety measures are built into the rail infrastructure, future versions of the European railway safety system ERT...
Hans Scholten, Roel Westenberg, Manfred Schoemaker
INFOCOM
2000
IEEE
15 years 10 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
IPPS
1997
IEEE
15 years 10 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 10 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman