1686 search results - page 68 / 338 » Programs as polygraphs: computability and complexity |
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
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...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
ACTAC
2006
14 years 9 months ago
2006
The surgery of fractured bones is often a very complex problem. That is the reason why it would be beneficial to create a geometric and mechanic model of the bones before surgical...