244 search results - page 44 / 49 » On the Tightness of the Buhrman-Cleve-Wigderson Simulation |
DSN
2002
IEEE
14 years 24 days ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
HPDC
2002
IEEE
14 years 24 days ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
INFOCOM
2002
IEEE
14 years 23 days ago
2002
IEEE
Abstract— This paper introduces a new packet marking algorithm that can be used in the context of Assured Forwarding (AF) in the Differentiated Services (DiffServ) framework [1],...
CAV
2001
Springer
14 years 11 days ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...