41 search results - page 4 / 9 » Distributed Transitive Closure Computations: The Disconnecti... |
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
ECCC
2010
13 years 4 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
CONCUR
2001
Springer
13 years 12 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
ATAL
2003
Springer
14 years 19 days ago
2003
Springer
This paper introduces a methodology to help the programmer in the transition from a set of desired global properties expressed as an equation-based model (EBM) that a Multi-Agent ...