Sciweavers

217 search results - page 42 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
COCOON
2007
Springer
14 years 1 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
ICC
2011
IEEE
215views Communications» more  ICC 2011»
12 years 7 months ago
Optimal Packet Scheduling in a Broadcast Channel with an Energy Harvesting Transmitter
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
Jing Yang, Omur Ozel, Sennur Ulukus
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months 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
PODC
2012
ACM
11 years 10 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
ICDCN
2009
Springer
14 years 2 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...