338 search results - page 25 / 68 » On the Complexity of Termination Inference for Processes |
TCS
2008
14 years 9 months ago
2008
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
UAI
2008
14 years 11 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
126
click to vote
EDBTW
2006
Springer
15 years 1 months ago
2006
Springer
Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks...
AGI
2008
14 years 11 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...