Sciweavers

1480 search results - page 194 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
GLOBECOM
2008
IEEE
15 years 7 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
EURODAC
1995
IEEE
202views VHDL» more  EURODAC 1995»
15 years 4 months ago
Hardware-software co-synthesis of fault-tolerant real-time distributed embedded systems
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
Santhanam Srinivasan, Niraj K. Jha
EMSOFT
2006
Springer
15 years 4 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
82
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
110
Voted
WINET
2010
185views more  WINET 2010»
14 years 11 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya