| 2008 |
| 52 | | Michael Freed,
Jaime G. Carbonell,
Geoffrey J. Gordon,
Jordan Hayes,
Brad A. Myers,
Daniel P. Siewiorek,
Stephen Smith,
Aaron Steinfeld,
Anthony Tomasic:
RADAR: A Personal Assistant that Learns to Reduce Email Overload.
AAAI 2008: 1287-1293 |
| 51 | EE | Jan-P. Calliess,
Geoffrey J. Gordon:
No-regret learning and a mechanism for distributed multiagent planning.
AAMAS (1) 2008: 509-516 |
| 50 | EE | Ajit Paul Singh,
Geoffrey J. Gordon:
A Unified View of Matrix Factorization Models.
ECML/PKDD (2) 2008: 358-373 |
| 49 | EE | Geoffrey J. Gordon,
Amy R. Greenwald,
Casey Marks:
No-regret learning in convex games.
ICML 2008: 360-367 |
| 48 | EE | Irina Rish,
Genady Grabarnik,
Guillermo Cecchi,
Francisco Pereira,
Geoffrey J. Gordon:
Closed-form supervised dimensionality reduction with generalized linear models.
ICML 2008: 832-839 |
| 47 | EE | Ajit Paul Singh,
Geoffrey J. Gordon:
Relational learning via collective matrix factorization.
KDD 2008: 650-658 |
| 46 | EE | Maxim Likhachev,
Dave Ferguson,
Geoffrey J. Gordon,
Anthony Stentz,
Sebastian Thrun:
Anytime search in dynamic graphs.
Artif. Intell. 172(14): 1613-1643 (2008) |
| 2007 |
| 45 | | H. Brendan McMahan,
Geoffrey J. Gordon:
A Unification of Extensive-Form Games and Markov Decision Processes.
AAAI 2007: 86-93 |
| 44 | EE | Kian Hsiang Low,
Geoffrey J. Gordon,
John M. Dolan,
Pradeep K. Khosla:
Adaptive Sampling for Multi-Robot Wide-Area Exploration.
ICRA 2007: 755-760 |
| 43 | EE | Shann-Ching Chen,
Ting Zhao,
Geoffrey J. Gordon,
Robert F. Murphy:
Automated image analysis of protein localization in budding yeast.
ISMB/ECCB (Supplement of Bioinformatics) 2007: 66-71 |
| 42 | EE | Geoffrey J. Gordon:
Agendas for multi-agent learning.
Artif. Intell. 171(7): 392-401 (2007) |
| 2006 |
| 41 | EE | Matthijs T. J. Spaan,
Geoffrey J. Gordon,
Nikos A. Vlassis:
Decentralized planning under uncertainty for teams of communicating agents.
AAMAS 2006: 249-256 |
| 40 | EE | Shann-Ching Chen,
Ting Zhao,
Geoffrey J. Gordon,
Robert F. Murphy:
A Novel Graphical Model Approach to Segmenting Cell Images.
CIBCB 2006: 1-8 |
| 39 | EE | Francisco Pereira,
Geoffrey J. Gordon:
The support vector decomposition machine.
ICML 2006: 689-696 |
| 38 | EE | 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.
ISBI 2006: 558-561 |
| 37 | EE | Chris Murray,
Geoffrey J. Gordon:
Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in General-Sum Stochastic Games.
NIPS 2006: 1001-1008 |
| 36 | EE | Geoffrey J. Gordon:
No-regret Algorithms for Online Convex Programs.
NIPS 2006: 489-496 |
| 35 | EE | Brian P. Gerkey,
Sebastian Thrun,
Geoffrey J. Gordon:
Visibility-based Pursuit-evasion with Limited Field of View.
I. J. Robotic Res. 25(4): 299-315 (2006) |
| 34 | EE | Joelle Pineau,
Geoffrey J. Gordon,
Sebastian Thrun:
Anytime Point-Based Approximations for Large POMDPs.
J. Artif. Intell. Res. (JAIR) 27: 335-380 (2006) |
| 33 | EE | Nikos A. Vlassis,
Geoffrey J. Gordon,
Joelle Pineau:
Planning under uncertainty in robotics.
Robotics and Autonomous Systems 54(11): 885-886 (2006) |
| 2005 |
| 32 | | H. Brendan McMahan,
Geoffrey J. Gordon:
Fast Exact Planning in Markov Decision Processes.
ICAPS 2005: 151-160 |
| 31 | | Maxim Likhachev,
David I. Ferguson,
Geoffrey J. Gordon,
Anthony Stentz,
Sebastian Thrun:
Anytime Dynamic A*: An Anytime, Replanning Algorithm.
ICAPS 2005: 262-271 |
| 30 | EE | H. Brendan McMahan,
Maxim Likhachev,
Geoffrey J. Gordon:
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees.
ICML 2005: 569-576 |
| 29 | | Rosemary Emery-Montemerlo,
Geoffrey J. Gordon,
Jeff G. Schneider,
Sebastian Thrun:
Game Theoretic Control for Robot Teams.
ICRA 2005: 1163-1169 |
| 28 | EE | Joelle Pineau,
Geoffrey J. Gordon:
POMDP Planning for Robust Robot Control.
ISRR 2005: 69-82 |
| 27 | EE | Nicholas Roy,
Geoffrey J. Gordon,
Sebastian Thrun:
Finding Approximate POMDP solutions Through Belief Compression.
J. Artif. Intell. Res. (JAIR) 23: 1-40 (2005) |
| 2004 |
| 26 | | Brian P. Gerkey,
Sebastian Thrun,
Geoffrey J. Gordon:
Visibility-Based Pursuit-Evasion with Limited Field of View.
AAAI 2004: 20-27 |
| 25 | EE | Rosemary Emery-Montemerlo,
Geoffrey J. Gordon,
Jeff G. Schneider,
Sebastian Thrun:
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs.
AAMAS 2004: 136-143 |
| 24 | EE | Matthew Rosencrantz,
Geoffrey J. Gordon,
Sebastian Thrun:
Learning low dimensional predictive representations.
ICML 2004 |
| 23 | EE | Maxim Likhachev,
Geoffrey J. Gordon,
Sebastian Thrun:
Planning for Markov Decision Processes with Sparse Stochasticity.
NIPS 2004 |
| 2003 |
| 22 | EE | Matthew Rosencrantz,
Geoffrey J. Gordon,
Sebastian Thrun:
Locating moving entities in indoor environments with teams of mobile robots.
AAMAS 2003: 233-240 |
| 21 | EE | Nicholas Roy,
Geoffrey J. Gordon,
Sebastian Thrun:
Planning under Uncertainty for Reliable Health Care Robotics.
FSR 2003: 417-426 |
| 20 | | H. Brendan McMahan,
Geoffrey J. Gordon,
Avrim Blum:
Planning in the Presence of Cost Functions Controlled by an Adversary.
ICML 2003: 536-543 |
| 19 | | Joelle Pineau,
Geoffrey J. Gordon,
Sebastian Thrun:
Point-based value iteration: An anytime algorithm for POMDPs.
IJCAI 2003: 1025-1032 |
| 18 | | 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.
IJCAI 2003: 1427-1428 |
| 17 | EE | Maxim Likhachev,
Geoffrey J. Gordon,
Sebastian Thrun:
ARA*: Anytime A* with Provable Bounds on Sub-Optimality.
NIPS 2003 |
| 16 | EE | Joelle Pineau,
Geoffrey J. Gordon,
Sebastian Thrun:
Applying Metric-Trees to Belief-Point POMDPs.
NIPS 2003 |
| 15 | EE | Curt A. Bererton,
Geoffrey J. Gordon,
Sebastian Thrun:
Auction Mechanism Design for Multi-Robot Coordination.
NIPS 2003 |
| 14 | EE | Aaron C. Courville,
Nathaniel D. Daw,
Geoffrey J. Gordon,
David S. Touretzky:
Model Uncertainty in Classical Conditioning.
NIPS 2003 |
| 13 | | Joelle Pineau,
Geoffrey J. Gordon,
Sebastian Thrun:
Policy-contingent abstraction for robust robot control.
UAI 2003: 477-484 |
| 12 | | Matthew Rosencrantz,
Geoffrey J. Gordon,
Sebastian Thrun:
Decentralized Sensor Fusion with Distributed Particle Filters.
UAI 2003: 493-500 |
| 2002 |
| 11 | EE | Nicholas Roy,
Geoffrey J. Gordon:
Exponential Family PCA for Belief Compression in POMDPs.
NIPS 2002: 1635-1642 |
| 10 | EE | Geoffrey J. Gordon:
Generalized2 Linear2 Models.
NIPS 2002: 577-584 |
| 9 | | Carlos Guestrin,
Geoffrey J. Gordon:
Distributed Planning in Hierarchical Factored MDPs.
UAI 2002: 197-206 |
| 2000 |
| 8 | | Geoffrey J. Gordon,
Andrew Moore:
Learning Filaments.
ICML 2000: 335-342 |
| 7 | | Geoffrey J. Gordon:
Reinforcement Learning with Function Approximation Converges to a Region.
NIPS 2000: 1040-1046 |
| 1999 |
| 6 | EE | Geoffrey J. Gordon:
Regret Bounds for Prediction Problems.
COLT 1999: 29-40 |
| 1996 |
| 5 | | Geoffrey J. Gordon,
Alberto Maria Segre:
Nonparametric Statistical Methods for Experimental Evaluations of Speedup Learning.
ICML 1996: 200-206 |
| 4 | EE | Alberto Maria Segre,
Geoffrey J. Gordon,
Charles Elkan:
Exploratory Analysis of Speedup Learning Data Using Epectation Maximization.
Artif. Intell. 85(1-2): 301-319 (1996) |
| 1995 |
| 3 | | Geoffrey J. Gordon:
Stable Function Approximation in Dynamic Programming.
ICML 1995: 261-268 |
| 2 | EE | Geoffrey J. Gordon:
Stable Fitted Reinforcement Learning.
NIPS 1995: 1052-1058 |
| 1993 |
| 1 | | Alberto Maria Segre,
Geoffrey J. Gordon:
Sholom M. Weiss and Casimir A. Kulikowski, Computer Systems That Learn.
Artif. Intell. 62(2): 363-378 (1993) |