242 search results - page 3 / 49 » Distributed algorithms with dynamical random transitions |
STOC
2002
ACM
14 years 6 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
IPSN
2005
Springer
13 years 11 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
PPSN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
KI
2009
Springer
14 years 10 days ago
2009
Springer
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
HPCA
2005
IEEE
14 years 6 months ago
2005
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Proposed on-line systems automatically group these similar intervals of execution in...