697 search results - page 135 / 140 » On the Theory of Average Case Complexity |
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
MOBICOM
2003
ACM
14 years 1 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
CDC
2009
IEEE
14 years 14 days ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
FOCS
2000
IEEE
14 years 5 days ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
PKC
1999
Springer
14 years 7 hour ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...