Sciweavers

5171 search results - page 599 / 1035
» Deterministic Parallel Processing
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 29 days ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
146
Voted
CPAIOR
2009
Springer
16 years 29 days ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
177
Voted
MOBICOM
2009
ACM
16 years 27 days ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
CSFW
2008
IEEE
16 years 26 days ago
Information Flow in Systems with Schedulers
Abstract. The focus of work on information flow security has primarily been on definitions of security in asynchronous systems models. This paper considers systems with scheduler...
Ron van der Meyden, Chenyi Zhang
INFOCOM
2008
IEEE
16 years 24 days ago
On the Performance of IEEE 802.11 under Jamming
—In this paper, we study the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. We study two chann...
Emrah Bayraktaroglu, Christopher King, Xin Liu, Gu...