Sciweavers

2473 search results - page 355 / 495
» The Logic of Communication Graphs
Sort
View
SIAMJO
2010
110views more  SIAMJO 2010»
15 years 1 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
SPAA
2009
ACM
16 years 1 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
162
Voted
INFOCOM
2007
IEEE
16 years 17 days ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
SPAA
2003
ACM
15 years 11 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
MICRO
2008
IEEE
79views Hardware» more  MICRO 2008»
15 years 6 months ago
Strategies for mapping dataflow blocks to distributed hardware
Distributed processors must balance communication and concurrency. When dividing instructions among the processors, key factors are the available concurrency, criticality of depen...
Behnam Robatmili, Katherine E. Coons, Doug Burger,...