646 search results - page 111 / 130 » Generalized efficiency bounds in distributed resource alloca... |
SPAA
1990
ACM
15 years 5 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
119
Voted
PODS
2008
ACM
16 years 2 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
106
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
92
Voted
RELMICS
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
126
Voted
SUTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...