3415 search results - page 502 / 683 » Lower bounds on kernelization |
180
click to vote
SPAA
2009
ACM
16 years 29 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
148
click to vote
ESOP
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
189
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
185
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
168
click to vote
QEST
2008
IEEE
16 years 16 days ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...