Sciweavers

533 search results - page 97 / 107
» Playing games with approximation algorithms
Sort
View
ATAL
2003
Springer
14 years 23 days ago
Coordination in multiagent reinforcement learning: a Bayesian approach
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
Georgios Chalkiadakis, Craig Boutilier
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
13 years 11 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
ATAL
2010
Springer
13 years 8 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
JAIR
2010
115views more  JAIR 2010»
13 years 6 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech