122 search results - page 16 / 25 » Using Disjoint Reachability for Parallelization |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
GRID
2007
Springer
14 years 1 months ago
2007
Springer
— In order for Grids to become relied upon for critical infrastructure and reliable scientific computing, Grid-wide management must be automated so that it is possible in quickly...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...