- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j7 |      | H. Brendan McMahan, Matthew J. Streeter: Open Problem: Better Bounds for Online Logistic Regression. Journal of Machine Learning Research - Proceedings Track 23: 44.1-44.3 (2012) |
| c21 | | Matthew J. Streeter, H. Brendan McMahan: No-Regret Algorithms for Unconstrained Online Convex Optimization. NIPS 2012: 2411-2419 |
| i6 | | Matthew J. Streeter, Stephen F. Smith: New Techniques for Algorithm Portfolio Design. CoRR abs/1206.3286 (2012) |
| i5 | | Matthew J. Streeter, H. Brendan McMahan: No-Regret Algorithms for Unconstrained Online Convex Optimization. CoRR abs/1211.2260 (2012) |
| 2011 | ||
| i4 | | Stephen F. Smith, Matthew J. Streeter: How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. CoRR abs/1110.0024 (2011) |
| 2010 | ||
| c20 | | H. Brendan McMahan, Matthew J. Streeter: Adaptive Bound Optimization for Online Convex Optimization. COLT 2010: 244-256 |
| i3 | | Matthew J. Streeter, H. Brendan McMahan: Less Regret via Online Conditioning. CoRR abs/1002.4862 (2010) |
| i2 | | H. Brendan McMahan, Matthew J. Streeter: Adaptive Bound Optimization for Online Convex Optimization. CoRR abs/1002.4908 (2010) |
| 2009 | ||
| c19 | | H. Brendan McMahan, Matthew J. Streeter: Tighter Bounds for Multi-Armed Bandits with Expert Advice. COLT 2009 |
| c18 | | Matthew J. Streeter, Daniel Golovin, Andreas Krause: Online Learning of Assignments. NIPS 2009: 1794-1802 |
| i1 | | Daniel Golovin, Andreas Krause, Matthew J. Streeter: Online Learning of Assignments that Maximize Submodular Functions. CoRR abs/0908.0772 (2009) |
| 2008 | ||
| j6 | | John R. Koza, Matthew J. Streeter, Martin A. Keane: Routine high-return human-competitive automated problem-solving by means of genetic programming. Inf. Sci. 178(23): 4434-4452 (2008) |
| c17 | | Matthew J. Streeter, Daniel Golovin: An Online Algorithm for Maximizing Submodular Functions. NIPS 2008: 1577-1584 |
| c16 | | Matthew J. Streeter, Stephen F. Smith: New Techniques for Algorithm Portfolio Design. UAI 2008: 519-527 |
| 2007 | ||
| c15 | | Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Combining Multiple Heuristics Online. AAAI 2007: 1197-1203 |
| c14 | | Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Restart Schedules for Ensembles of Problem Instances. AAAI 2007: 1204-1210 |
| c13 | | Matthew J. Streeter, Stephen F. Smith: Using Decision Procedures Efficiently for Optimization. ICAPS 2007: 312-319 |
| 2006 | ||
| j5 | | Matthew J. Streeter, Stephen F. Smith: How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. J. Artif. Intell. Res. (JAIR) 26: 247-287 (2006) |
| c12 | | Matthew J. Streeter, Stephen F. Smith: An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem. AAAI 2006: 135-142 |
| c11 | | Matthew J. Streeter, Stephen F. Smith: Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling. ICAPS 2006: 324-333 |
| c10 | | Matthew J. Streeter, Stephen F. Smith: A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem. CP 2006: 560-574 |
| 2005 | ||
| c9 | | Matthew J. Streeter, Stephen F. Smith: Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. ICAPS 2005: 61-70 |
| 2004 | ||
| j4 | | John R. Koza, Martin A. Keane, Matthew J. Streeter, Thomas P. Adams, Lee W. Jones: Invention and creativity in automated design by means of genetic programming. AI EDAM 18(3): 245-269 (2004) |
| j3 | | John R. Koza, Martin A. Keane, Matthew J. Streeter: Routine automated synthesis of five patented analog circuits using genetic programming. Soft Comput. 8(5): 318-324 (2004) |
| c8 | | John R. Koza, Martin A. Keane, Matthew J. Streeter: Routine High-Return Human-Competitive Evolvable Hardware. Evolvable Hardware 2004: 3-17 |
| c7 | | Matthew J. Streeter: Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions. GECCO (2) 2004: 186-197 |
| 2003 | ||
| j2 | | John R. Koza, Martin A. Keane, Matthew J. Streeter: What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results. IEEE Intelligent Systems 18(3): 25-31 (2003) |
| j1 | | Matthew J. Streeter, Lee A. Becker: Automated Discovery of Numerical Approximation Formulae via Genetic Programming. Genetic Programming and Evolvable Machines 4(3): 255-286 (2003) |
| c6 | | John R. Koza, Martin A. Keane, Matthew J. Streeter: The Importance of Reuse and Development in Evolvable Hardware. Evolvable Hardware 2003: 33-42 |
| c5 | | |
| c4 | | Matthew J. Streeter: Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold. GECCO 2003: 1418-1430 |
| 2002 | ||
| c3 | | Martin A. Keane, John R. Koza, Matthew J. Streeter: Automatic Synthesis Using Genetic Programming of an Improved General-Purpose Controller for Industrially Representative Plants. Evolvable Hardware 2002: 113-122 |
| c2 | | Matthew J. Streeter, Martin A. Keane, John R. Koza: Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming. EuroGP 2002: 26-36 |
| c1 |  | Matthew J. Streeter, Martin A. Keane, John R. Koza: Iterative Refinement Of Computational Circuits Using Genetic Programming. GECCO 2002: 877-884 |
| 1 | Thomas P. Adams | |
| 2 | Lee A. Becker | |
| 3 | Daniel Golovin | |
| 4 | Lee W. Jones | |
| 5 | Martin A. Keane | |
| 6 | John R. Koza | |
| 7 | Andreas Krause | |
| 8 | H. Brendan McMahan | |
| 9 | Stephen F. Smith |
Colors in the list of coauthors
Last update Thu May 23 01:53:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page