278 search results - page 32 / 56 » Two Upper Bounds on the Chromatic Number |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
WDAG
2000
Springer
14 years 1 days ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...