 | 2009 |
|---|
| 24 |       | Daniel Golovin,
Andreas Krause,
Matthew J. Streeter:
Online Learning of Assignments that Maximize Submodular Functions
CoRR abs/0908.0772: (2009) |
| 2008 |
|---|
| 23 | | Matthew J. Streeter,
Daniel Golovin:
An Online Algorithm for Maximizing Submodular Functions.
NIPS 2008: 1577-1584 |
| 22 | | Matthew J. Streeter,
Stephen F. Smith:
New Techniques for Algorithm Portfolio Design.
UAI 2008: 519-527 |
| 21 | | 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) |
| 2007 |
|---|
| 20 |  | Matthew J. Streeter,
Daniel Golovin,
Stephen F. Smith:
Combining Multiple Heuristics Online.
AAAI 2007: 1197-1203 |
| 19 | | Matthew J. Streeter,
Daniel Golovin,
Stephen F. Smith:
Restart Schedules for Ensembles of Problem Instances.
AAAI 2007: 1204-1210 |
| 18 | | Matthew J. Streeter,
Stephen F. Smith:
Using Decision Procedures Efficiently for Optimization.
ICAPS 2007: 312-319 |
| 2006 |
|---|
| 17 | | Matthew J. Streeter,
Stephen F. Smith:
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem.
AAAI 2006 |
| 16 | | Matthew J. Streeter,
Stephen F. Smith:
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem.
CP 2006: 560-574 |
| 15 | | 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 |
| 14 | | 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) |
| 2005 |
|---|
| 13 | | Matthew J. Streeter,
Stephen F. Smith:
Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem.
ICAPS 2005: 61-70 |
| 2004 |
|---|
| 12 | | John R. Koza,
Martin A. Keane,
Matthew J. Streeter:
Routine High-Return Human-Competitive Evolvable Hardware.
Evolvable Hardware 2004: 3-17 |
| 11 | | Matthew J. Streeter:
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.
GECCO (2) 2004: 186-197 |
| 10 | | 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) |
| 9 | | 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) |
| 2003 |
|---|
| 8 | | Matthew J. Streeter:
The Root Causes of Code Growth in Genetic Programming.
EuroGP 2003: 443-454 |
| 7 | | John R. Koza,
Martin A. Keane,
Matthew J. Streeter:
The Importance of Reuse and Development in Evolvable Hardware.
Evolvable Hardware 2003: 33-42 |
| 6 | | Matthew J. Streeter:
Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold.
GECCO 2003: 1418-1430 |
| 5 | | 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) |
| 4 | | 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) |
| 2002 |
|---|
| 3 | | 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 |
| 2 | | 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 |
| 1 | | Matthew J. Streeter,
Martin A. Keane,
John R. Koza:
Iterative Refinement Of Computational Circuits Using Genetic Programming.
GECCO 2002: 877-884 |
