338 search results - page 2 / 68 » On the Complexity of Termination Inference for Processes |
UAI
1998
13 years 6 months ago
1998
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
NIPS
2007
13 years 6 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
JPDC
2008
13 years 5 months ago
2008
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
LFCS
2009
Springer
13 years 11 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
ICPADS
2002
IEEE
13 years 10 months ago
2002
IEEE
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...