Sciweavers

7133 search results - page 133 / 1427
» Communication algorithms with advice
Sort
View
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
13 years 11 months ago
An evolutionary design technique for collective communications on optimal diameter-degree networks
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
Jirí Jaros, Vaclav Dvorak
HPCC
2011
Springer
12 years 9 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 4 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
MIDDLEWARE
2004
Springer
14 years 3 months ago
Designing a context-aware middleware for asynchronous communication in mobile ad hoc environments
In mobile ad hoc networks, synchronous communication mechanisms appear to be not suitable, since these assume that the involved entities are present at the same time during the in...
Mirco Musolesi
MM
2003
ACM
168views Multimedia» more  MM 2003»
14 years 3 months ago
Interacting with audio streams for entertainment and communication
We present a new model of interactive audio for entertainment and communication. A new device called the DJammer and its associated technologies are described. The DJammer introdu...
Mat C. Hans, Mark T. Smith