Search the dblp DataBase
Matthew J. Streeter :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Matthew J. Streeter , Stephen F. Smith An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP ] AAAI, 2006, pp:- [Conf ] Matthew J. Streeter , Stephen F. Smith Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] ICAPS, 2005, pp:61-70 [Conf ] Matthew J. Streeter , Stephen F. Smith A Simple Distribution-Free Approach to the Max k -Armed Bandit Problem. [Citation Graph (0, 0)][DBLP ] CP, 2006, pp:560-574 [Conf ] Martin A. Keane , John R. Koza , Matthew J. Streeter Automatic Synthesis Using Genetic Programming of an Improved General-Purpose Controller for Industrially Representative Plants. [Citation Graph (0, 0)][DBLP ] Evolvable Hardware, 2002, pp:113-122 [Conf ] John R. Koza , Martin A. Keane , Matthew J. Streeter The Importance of Reuse and Development in Evolvable Hardware. [Citation Graph (0, 0)][DBLP ] Evolvable Hardware, 2003, pp:33-42 [Conf ] John R. Koza , Martin A. Keane , Matthew J. Streeter Routine High-Return Human-Competitive Evolvable Hardware. [Citation Graph (0, 0)][DBLP ] Evolvable Hardware, 2004, pp:3-17 [Conf ] Matthew J. Streeter The Root Causes of Code Growth in Genetic Programming. [Citation Graph (0, 0)][DBLP ] EuroGP, 2003, pp:443-454 [Conf ] Matthew J. Streeter , Martin A. Keane , John R. Koza Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming. [Citation Graph (0, 0)][DBLP ] EuroGP, 2002, pp:26-36 [Conf ] Matthew J. Streeter Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold. [Citation Graph (0, 0)][DBLP ] GECCO, 2003, pp:1418-1430 [Conf ] Matthew J. Streeter Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions. [Citation Graph (0, 0)][DBLP ] GECCO (2), 2004, pp:186-197 [Conf ] Matthew J. Streeter , Martin A. Keane , John R. Koza Iterative Refinement Of Computational Circuits Using Genetic Programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2002, pp:877-884 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] AI EDAM, 2004, v:18, n:3, pp:245-269 [Journal ] John R. Koza , Martin A. Keane , Matthew J. Streeter What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results. [Citation Graph (0, 0)][DBLP ] IEEE Intelligent Systems, 2003, v:18, n:3, pp:25-31 [Journal ] Matthew J. Streeter , Lee A. Becker Automated Discovery of Numerical Approximation Formulae via Genetic Programming. [Citation Graph (0, 0)][DBLP ] Genetic Programming and Evolvable Machines, 2003, v:4, n:3, pp:255-286 [Journal ] John R. Koza , Martin A. Keane , Matthew J. Streeter Routine automated synthesis of five patented analog circuits using genetic programming. [Citation Graph (0, 0)][DBLP ] Soft Comput., 2004, v:8, n:5, pp:318-324 [Journal ] Matthew J. Streeter , Daniel Golovin , Stephen F. Smith Combining Multiple Heuristics Online. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:1197-1203 [Conf ] Matthew J. Streeter , Daniel Golovin , Stephen F. Smith Restart Schedules for Ensembles of Problem Instances. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:1204-1210 [Conf ] Matthew J. Streeter , Stephen F. Smith Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling. [Citation Graph (0, 0)][DBLP ] ICAPS, 2006, pp:324-333 [Conf ] Matthew J. Streeter , Stephen F. Smith How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2006, v:26, n:, pp:247-287 [Journal ] Using Decision Procedures Efficiently for Optimization. [Citation Graph (, )][DBLP ] An Online Algorithm for Maximizing Submodular Functions. [Citation Graph (, )][DBLP ] New Techniques for Algorithm Portfolio Design. [Citation Graph (, )][DBLP ] Online Learning of Assignments that Maximize Submodular Functions [Citation Graph (, )][DBLP ] Less Regret via Online Conditioning [Citation Graph (, )][DBLP ] Adaptive Bound Optimization for Online Convex Optimization [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.306secs