Sciweavers

866 search results - page 25 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
PODC
2009
ACM
16 years 6 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
GIS
2009
ACM
15 years 10 months ago
A new perspective on efficient and dependable vehicle routing
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA algorithm, an effici...
Dieter Pfoser, Alexandros Efentakis, Agnès ...
MOBIHOC
2008
ACM
16 years 5 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
DIALM
2000
ACM
112views Algorithms» more  DIALM 2000»
15 years 10 months ago
A decision-theoretic approach to resource allocation in wireless multimedia networks
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li, S...