The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

H. Brendan McMahan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. H. Brendan McMahan, Geoffrey J. Gordon
    Fast Exact Planning in Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:151-160 [Conf]
  2. H. Brendan McMahan, Avrim Blum
    Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:109-123 [Conf]
  3. H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
    Planning in the Presence of Cost Functions Controlled by an Adversary. [Citation Graph (0, 0)][DBLP]
    ICML, 2003, pp:536-543 [Conf]
  4. H. Brendan McMahan, Maxim Likhachev, Geoffrey J. Gordon
    Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:569-576 [Conf]
  5. Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
    Online convex optimization in the bandit setting: gradient descent without a gradient. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:385-394 [Conf]
  6. Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
    Online convex optimization in the bandit setting: gradient descent without a gradient [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. H. Brendan McMahan, Andrzej Proskurowski
    Multi-source spanning trees: algorithms for minimizing source eccentricities. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:213-222 [Journal]
  8. H. Brendan McMahan, Geoffrey J. Gordon
    A Unification of Extensive-Form Games and Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:86-93 [Conf]
  9. Brent Bryan, H. Brendan McMahan, Chad M. Schafer, Jeff G. Schneider
    Efficiently computing minimax expected-size confidence regions. [Citation Graph (0, 0)][DBLP]
    ICML, 2007, pp:97-104 [Conf]

  10. Selecting Observations against Adversarial Objectives. [Citation Graph (, )][DBLP]


  11. Less Regret via Online Conditioning [Citation Graph (, )][DBLP]


  12. Adaptive Bound Optimization for Online Convex Optimization [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002