-
1
-
-
0000245736
-
Complexity of finding embeddings in a k-tree
-
S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):277-284, 1987.
-
(1987)
SIAM Journal of Algebraic and Discrete Methods
, vol.8
, Issue.2
, pp. 277-284
-
-
Arnborg, S.1
Corneil, D.2
Proskurowski, A.3
-
5
-
-
17444409624
-
A tutorial on the cross-entropy method
-
P.-T. de Boer, D. P. Kroese, S. Mannor, and R. Y. Rubinstein. A tutorial on the cross-entropy method. Annals of Operations Research, 134(1):19-67, 2005.
-
(2005)
Annals of Operations Research
, vol.134
, Issue.1
, pp. 19-67
-
-
De Boer, P.-T.1
Kroese, D.P.2
Mannor, S.3
Rubinstein, R.Y.4
-
6
-
-
40949147745
-
A comprehensive survey of multi-agent reinforcement learning
-
Mar
-
L. Bu̧soniu, R. Babu?ska, and B. De Schutter. A comprehensive survey of multi-agent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 38(2):156-172, Mar. 2008.
-
(2008)
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
, vol.38
, Issue.2
, pp. 156-172
-
-
Bu̧soniu, L.1
Babuska, R.2
De Schutter, B.3
-
7
-
-
84880741159
-
Existential arc consistency: Getting closer to full arc consistency in weighted csps
-
S. de Givry, F. Heras, M. Zytnicki, and J. Larrosa. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In Proc. of the International Joint Conference on Artificial Intelligence, pages 84-89, 2005.
-
(2005)
Proc. of the International Joint Conference on Artificial Intelligence
, pp. 84-89
-
-
De Givry, S.1
Heras, F.2
Zytnicki, M.3
Larrosa, J.4
-
8
-
-
0033188982
-
Bucket elimination: A unifying framework for reasoning
-
Sept
-
R. Dechter. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113:41-85, Sept. 1999.
-
(1999)
Artificial Intelligence
, vol.113
, pp. 41-85
-
-
Dechter, R.1
-
9
-
-
4544325183
-
Approximate solutions for partially observable stochastic games with common payoffs
-
R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems, pages 136-143, 2004.
-
(2004)
Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems
, pp. 136-143
-
-
Emery-Montemerlo, R.1
Gordon, G.2
Schneider, J.3
Thrun, S.4
-
10
-
-
84899946303
-
Decentralised coordination of low-power embedded devices using the max-sum algorithm
-
A. Farinelli, A. Rogers, A. Petcu, and N. R. Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems, pages 639-646, 2008.
-
(2008)
Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems
, pp. 639-646
-
-
Farinelli, A.1
Rogers, A.2
Petcu, A.3
Jennings, N.R.4
-
13
-
-
0000725056
-
Games with incomplete information played by 'bayesian' players, parts i, ii and ii
-
320-334, 486-502. 1968
-
J. C. Harsanyi. Games with incomplete information played by 'Bayesian' players, parts I, II and II. Management Science, 14:159-182, 320-334, 486-502, 1967-1968.
-
(1967)
Management Science
, vol.14
, pp. 159-182
-
-
Harsanyi, J.C.1
-
17
-
-
0032073263
-
Planning and acting in partially observable stochastic domains
-
L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
-
(1998)
Artificial Intelligence
, vol.101
, Issue.1-2
, pp. 99-134
-
-
Kaelbling, L.P.1
Littman, M.L.2
Cassandra, A.R.3
-
18
-
-
84926111807
-
Graphical games
-
In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Cambridge University Press, Sept
-
M. J. Kearns. Graphical games. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, Sept. 2007.
-
(2007)
Algorithmic Game Theory
-
-
Kearns, M.J.1
-
20
-
-
33748562008
-
Using the max-plus algorithm for multiagent decision making in coordination graphs
-
Osaka, Japan, July
-
J. R. Kok and N. Vlassis. Using the max-plus algorithm for multiagent decision making in coordination graphs. In RoboCup-2005: Robot Soccer World Cup IX, Osaka, Japan, July 2005.
-
(2005)
RoboCup-2005: Robot Soccer World Cup IX
-
-
Kok, J.R.1
Vlassis, N.2
-
21
-
-
33748543203
-
Collaborative multiagent reinforcement learning by payoff propagation
-
J. R. Kok and N. Vlassis. Collaborative multiagent reinforcement learning by payoff propagation. Journal of Machine Learning Research, 7:1789-1828, 2006.
-
(2006)
Journal of Machine Learning Research
, vol.7
, pp. 1789-1828
-
-
Kok, J.R.1
Vlassis, N.2
-
23
-
-
0141503453
-
Multi-agent influence diagrams for representing and solving games
-
Oct
-
D. Koller and B. Milch. Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior, 45(1):181-221, Oct. 2003.
-
(2003)
Games and Economic Behavior
, vol.45
, Issue.1
, pp. 181-221
-
-
Koller, D.1
Milch, B.2
-
24
-
-
0035246564
-
Factor graphs and the sum-product algorithm
-
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2):498-519, 2001.
-
(2001)
IEEE Transactions on Information Theory
, vol.47
, Issue.2
, pp. 498-519
-
-
Kschischang, F.R.1
Frey, B.J.2
Loeliger, H.-A.3
-
26
-
-
56049125779
-
Multiagent reinforcement learning for urban traffic control using coordination graphs
-
L. Kuyer, S. Whiteson, B. Bakker, and N. Vlassis. Multiagent reinforcement learning for urban traffic control using coordination graphs. In Proc. of the European Conference on Machine Learning, pages 656-671, 2008.
-
(2008)
Proc. of the European Conference on Machine Learning
, pp. 656-671
-
-
Kuyer, L.1
Whiteson, S.2
Bakker, B.3
Vlassis, N.4
-
27
-
-
80955142766
-
Most probable explanations in bayesian networks: Complexity and tractability
-
J. Kwisthout. Most probable explanations in Bayesian networks: Complexity and tractability. International Journal of Approximate Reasoning, 52(9), 2011.
-
(2011)
International Journal of Approximate Reasoning
, vol.52
, Issue.9
-
-
Kwisthout, J.1
-
29
-
-
69249213986
-
And/or branch-and-bound search for combinatorial optimization in graphical models
-
R. Marinescu and R. Dechter. And/or branch-and-bound search for combinatorial optimization in graphical models. Artificial Intelligence, 173(16-17):1457-1491, 2009.
-
(2009)
Artificial Intelligence
, vol.173
, Issue.16-17
, pp. 1457-1491
-
-
Marinescu, R.1
Dechter, R.2
-
30
-
-
84886054728
-
-
J. M. Mooij libDAI: library for discrete approximate inference, 2008
-
J. M. Mooij. libDAI: library for discrete approximate inference, 2008. URL http://www.jorismooij.nl/.
-
-
-
-
34
-
-
84899909133
-
Exploiting locality of interaction in factored Dec-POMDPs
-
May
-
F. A. Oliehoek, M. T. J. Spaan, S. Whiteson, and N. Vlassis. Exploiting locality of interaction in factored Dec-POMDPs. In Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems, pages 517-524, May 2008b.
-
(2008)
Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems
, pp. 517-524
-
-
Oliehoek, F.A.1
Spaan, M.T.J.2
Whiteson, S.3
Vlassis, N.4
-
35
-
-
84868289680
-
Heuristic search for identical payoff bayesian games
-
May
-
F. A. Oliehoek, M. T. J. Spaan, J. S. Dibangoye, and C. Amato. Heuristic search for identical payoff Bayesian games. In Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems, pages 1115-1122, May 2010.
-
(2010)
Proc. of the International Joint Conference on Autonomous Agents and Multi Agent Systems
, pp. 1115-1122
-
-
Oliehoek, F.A.1
Spaan, M.T.J.2
Dibangoye, J.S.3
Amato, C.4
-
37
-
-
26444601262
-
Cooperative multi-agent learning: The state of the art
-
L. Panait and S. Luke. Cooperative multi-agent learning: The state of the art. Autonomous Agents and Multi-Agent Systems, 11(3):387-434, 2005.
-
(2005)
Autonomous Agents and Multi-Agent Systems
, vol.11
, Issue.3
, pp. 387-434
-
-
Panait, L.1
Luke, S.2
-
39
-
-
78650949545
-
Bounded approximate decentralised coordination via the max-sum algorithm
-
A. Rogers, A. Farinelli, R. Stranders, and N. Jennings. Bounded approximate decentralised coordination via the max-sum algorithm. Artificial Intelligence, 175(2):730-759, 2011.
-
(2011)
Artificial Intelligence
, vol.175
, Issue.2
, pp. 730-759
-
-
Rogers, A.1
Farinelli, A.2
Stranders, R.3
Jennings, N.4
-
43
-
-
0032096675
-
Multiagent systems
-
K. P. Sycara. Multiagent systems. AI Magazine, 19(2): 79-92, 1998.
-
(1998)
AI Magazine
, vol.19
, Issue.2
, pp. 79-92
-
-
Sycara, K.P.1
-
44
-
-
0022062265
-
On the complexity of decentralized decision making and detection problems
-
J. Tsitsiklis and M. Athans. On the complexity of decentralized decision making and detection problems. IEEE Transactions on Automatic Control, 30(5):440-446, 1985.
-
(1985)
IEEE Transactions on Automatic Control
, vol.30
, Issue.5
, pp. 440-446
-
-
Tsitsiklis, J.1
Athans, M.2
-
46
-
-
52949118902
-
A concise introduction to multiagent systems and distributed artificial intelligence
-
Morgan &Claypool Publishers
-
N. Vlassis. A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan &Claypool Publishers, 2007.
-
(2007)
Synthesis Lectures on Artificial Intelligence and Machine Learning
-
-
Vlassis, N.1
-
47
-
-
3943084089
-
Tree consistency and bounds on the performance of the maxproduct algorithm and its generalizations
-
M. Wainwright, T. Jaakkola, and A. Willsky. Tree consistency and bounds on the performance of the maxproduct algorithm and its generalizations. Statistics and Computing, 14(2):143-166, 2004.
-
(2004)
Statistics and Computing
, vol.14
, Issue.2
, pp. 143-166
-
-
Wainwright, M.1
Jaakkola, T.2
Willsky, A.3
|