Sciweavers

914 search results - page 165 / 183
» Branch and Bound on the Network Model
Sort
View
JSAC
2007
102views more  JSAC 2007»
13 years 7 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 7 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
13 years 11 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
ICDCSW
2005
IEEE
14 years 1 months ago
Capacity Estimation of Non-Synchronous Covert Channels
Capacity estimation is an important part of covert channel analysis. It measures the severity of a covert channel by estimating the maximum information rate attainable over it. Tr...
Zhenghong Wang, Ruby B. Lee