42 search results - page 3 / 9 » Message-passing algorithms for large structured decentralize... |
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
IJCAI
2003
13 years 7 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
SRDS
2008
IEEE
14 years 4 days ago
2008
IEEE
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
IPPS
2008
IEEE
14 years 5 days ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...