The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Geoffrey J. Gordon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brian P. Gerkey, Sebastian Thrun, Geoffrey J. Gordon
    Visibility-Based Pursuit-Evasion with Limited Field of View. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:20-27 [Conf]
  2. Maxim Likhachev, David I. Ferguson, Geoffrey J. Gordon, Anthony Stentz, Sebastian Thrun
    Anytime Dynamic A*: An Anytime, Replanning Algorithm. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:262-271 [Conf]
  3. H. Brendan McMahan, Geoffrey J. Gordon
    Fast Exact Planning in Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:151-160 [Conf]
  4. Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jeff G. Schneider, Sebastian Thrun
    Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:136-143 [Conf]
  5. Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian Thrun
    Locating moving entities in indoor environments with teams of mobile robots. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2003, pp:233-240 [Conf]
  6. Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A. Vlassis
    Decentralized planning under uncertainty for teams of communicating agents. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:249-256 [Conf]
  7. Geoffrey J. Gordon
    Regret Bounds for Prediction Problems. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:29-40 [Conf]
  8. Geoffrey J. Gordon
    Stable Function Approximation in Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    ICML, 1995, pp:261-268 [Conf]
  9. Geoffrey J. Gordon, Andrew Moore
    Learning Filaments. [Citation Graph (0, 0)][DBLP]
    ICML, 2000, pp:335-342 [Conf]
  10. Geoffrey J. Gordon, Alberto Maria Segre
    Nonparametric Statistical Methods for Experimental Evaluations of Speedup Learning. [Citation Graph (0, 0)][DBLP]
    ICML, 1996, pp:200-206 [Conf]
  11. 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]
  12. 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]
  13. Francisco Pereira, Geoffrey Gordon
    The support vector decomposition machine. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:689-696 [Conf]
  14. Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian Thrun
    Learning low dimensional predictive representations. [Citation Graph (0, 0)][DBLP]
    ICML, 2004, pp:- [Conf]
  15. Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
    Point-based value iteration: An anytime algorithm for POMDPs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1025-1032 [Conf]
  16. Sebastian Thrun, Geoffrey J. Gordon, Frank Pfenning, Mary Berna, Brennan Sellner, Brad Lisien
    A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1427-1428 [Conf]
  17. Shann-Ching Chen, Geoffrey J. Gordon, Robert F. Murphy
    A novel approximate inference approach to automated classification of protein subcellular location patterns in multi-cell images. [Citation Graph (0, 0)][DBLP]
    ISBI, 2006, pp:558-561 [Conf]
  18. Curt A. Bererton, Geoffrey J. Gordon, Sebastian Thrun
    Auction Mechanism Design for Multi-Robot Coordination. [Citation Graph (0, 0)][DBLP]
    NIPS, 2003, pp:- [Conf]
  19. Aaron C. Courville, Nathaniel D. Daw, Geoffrey J. Gordon, David S. Touretzky
    Model Uncertainty in Classical Conditioning. [Citation Graph (0, 0)][DBLP]
    NIPS, 2003, pp:- [Conf]
  20. Geoffrey J. Gordon
    Reinforcement Learning with Function Approximation Converges to a Region. [Citation Graph (0, 0)][DBLP]
    NIPS, 2000, pp:1040-1046 [Conf]
  21. Geoffrey J. Gordon
    Generalized2 Linear2 Models. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:577-584 [Conf]
  22. Geoffrey J. Gordon
    Stable Fitted Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    NIPS, 1995, pp:1052-1058 [Conf]
  23. Maxim Likhachev, Geoffrey J. Gordon, Sebastian Thrun
    ARA*: Anytime A* with Provable Bounds on Sub-Optimality. [Citation Graph (0, 0)][DBLP]
    NIPS, 2003, pp:- [Conf]
  24. Maxim Likhachev, Geoffrey J. Gordon, Sebastian Thrun
    Planning for Markov Decision Processes with Sparse Stochasticity. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  25. Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
    Applying Metric-Trees to Belief-Point POMDPs. [Citation Graph (0, 0)][DBLP]
    NIPS, 2003, pp:- [Conf]
  26. Nicholas Roy, Geoffrey J. Gordon
    Exponential Family PCA for Belief Compression in POMDPs. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:1635-1642 [Conf]
  27. Carlos Guestrin, Geoffrey J. Gordon
    Distributed Planning in Hierarchical Factored MDPs. [Citation Graph (0, 0)][DBLP]
    UAI, 2002, pp:197-206 [Conf]
  28. Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
    Policy-contingent abstraction for robust robot control. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:477-484 [Conf]
  29. Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian Thrun
    Decentralized Sensor Fusion with Distributed Particle Filters. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:493-500 [Conf]
  30. Alberto Maria Segre, Geoffrey J. Gordon
    Sholom M. Weiss and Casimir A. Kulikowski, Computer Systems That Learn. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1993, v:62, n:2, pp:363-378 [Journal]
  31. Alberto Maria Segre, Geoffrey J. Gordon, Charles Elkan
    Exploratory Analysis of Speedup Learning Data Using Epectation Maximization. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:85, n:1-2, pp:301-319 [Journal]
  32. Brian P. Gerkey, Sebastian Thrun, Geoffrey J. Gordon
    Visibility-based Pursuit-evasion with Limited Field of View. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2006, v:25, n:4, pp:299-315 [Journal]
  33. Nicholas Roy, Geoffrey J. Gordon, Sebastian Thrun
    Finding Approximate POMDP solutions Through Belief Compression. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:23, n:, pp:1-40 [Journal]
  34. Nikos A. Vlassis, Geoffrey J. Gordon, Joelle Pineau
    Planning under uncertainty in robotics. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 2006, v:54, n:11, pp:885-886 [Journal]
  35. 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]
  36. Kian Hsiang Low, Geoffrey J. Gordon, John M. Dolan, Pradeep K. Khosla
    Adaptive Sampling for Multi-Robot Wide-Area Exploration. [Citation Graph (0, 0)][DBLP]
    ICRA, 2007, pp:755-760 [Conf]
  37. Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jeff G. Schneider, Sebastian Thrun
    Game Theoretic Control for Robot Teams. [Citation Graph (0, 0)][DBLP]
    ICRA, 2005, pp:1163-1169 [Conf]
  38. Chris Murray, Geoffrey J. Gordon
    Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in General-Sum Stochastic Games. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:1001-1008 [Conf]
  39. Geoffrey J. Gordon
    No-regret Algorithms for Online Convex Programs. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:489-496 [Conf]
  40. Geoffrey J. Gordon
    Agendas for multi-agent learning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:7, pp:392-401 [Journal]
  41. Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
    Anytime Point-Based Approximations for Large POMDPs. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2006, v:27, n:, pp:335-380 [Journal]

  42. RADAR: A Personal Assistant that Learns to Reduce Email Overload. [Citation Graph (, )][DBLP]


  43. No-regret learning and a mechanism for distributed multiagent planning. [Citation Graph (, )][DBLP]


  44. Closing the learning-planning loop with predictive state representations. [Citation Graph (, )][DBLP]


  45. A Novel Graphical Model Approach to Segmenting Cell Images. [Citation Graph (, )][DBLP]


  46. No-regret learning in convex games. [Citation Graph (, )][DBLP]


  47. Closed-form supervised dimensionality reduction with generalized linear models. [Citation Graph (, )][DBLP]


  48. Hilbert Space Embeddings of Hidden Markov Models. [Citation Graph (, )][DBLP]


  49. Automated image analysis of protein localization in budding yeast. [Citation Graph (, )][DBLP]


  50. Relational learning via collective matrix factorization. [Citation Graph (, )][DBLP]


  51. A Constraint Generation Approach to Learning Stable Linear Dynamical Systems. [Citation Graph (, )][DBLP]


  52. A Unified View of Matrix Factorization Models. [Citation Graph (, )][DBLP]


  53. POMDP Planning for Robust Robot Control. [Citation Graph (, )][DBLP]


  54. Planning under Uncertainty for Reliable Health Care Robotics. [Citation Graph (, )][DBLP]


  55. Anytime search in dynamic graphs. [Citation Graph (, )][DBLP]


  56. Reduced-Rank Hidden Markov Models [Citation Graph (, )][DBLP]


  57. Closing the Learning-Planning Loop with Predictive State Representations [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
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