2084 search results - page 256 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
HYBRID
2010
Springer
15 years 4 months ago
2010
Springer
The main purpose of event-based control, if compared to periodic control, is to minimize data transfer or processing power in networked control systems. Current methods have an (i...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
TWC
2008
14 years 10 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
CONNECTION
2006
14 years 10 months ago
2006
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...