Matthew J. Streeter

According to our database1, Matthew J. Streeter authored at least 35 papers between 2002 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Mixture Modeling of Individual Learning Curves.
Proceedings of the 8th International Conference on Educational Data Mining, 2015

Behind the Scenes of Duolingo.
Proceedings of the 8th International Conference on Educational Data Mining, 2015

2014
Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments.
CoRR, 2014

Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2012
Open Problem: Better Bounds for Online Logistic Regression.
Proceedings of the COLT 2012, 2012

No-Regret Algorithms for Unconstrained Online Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2010
Less Regret via Online Conditioning
CoRR, 2010

Adaptive Bound Optimization for Online Convex Optimization.
Proceedings of the COLT 2010, 2010

2009
Online Learning of Assignments that Maximize Submodular Functions
CoRR, 2009

Online Learning of Assignments.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Tighter Bounds for Multi-Armed Bandits with Expert Advice.
Proceedings of the COLT 2009, 2009

2008
Routine high-return human-competitive automated problem-solving by means of genetic programming.
Inf. Sci., 2008

New Techniques for Algorithm Portfolio Design.
Proceedings of the UAI 2008, 2008

An Online Algorithm for Maximizing Submodular Functions.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

2007
Using Decision Procedures Efficiently for Optimization.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Restart Schedules for Ensembles of Problem Instances.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Combining Multiple Heuristics Online.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines.
J. Artif. Intell. Res., 2006

A Simple Distribution-Free Approach to the Max <i>k</i>-Armed Bandit Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem.
Proceedings of the Proceedings, 2006

Human-Competitive Evolvable Hardware Created by Means of Genetic Programming.
Proceedings of the Evolvable Hardware, 2006

2005
Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004
Routine automated synthesis of five patented analog circuits using genetic programming.
Soft Comput., 2004

Invention and creativity in automated design by means of genetic programming.
Artif. Intell. Eng. Des. Anal. Manuf., 2004

Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.
Proceedings of the Genetic and Evolutionary Computation, 2004

Routine High-Return Human-Competitive Evolvable Hardware.
Proceedings of the 6th NASA / DoD Workshop on Evolvable Hardware (EH 2004), 2004

2003
Automated Discovery of Numerical Approximation Formulae via Genetic Programming.
Genet. Program. Evolvable Mach., 2003

What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results.
IEEE Intell. Syst., 2003

Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold.
Proceedings of the Genetic and Evolutionary Computation, 2003

The Root Causes of Code Growth in Genetic Programming.
Proceedings of the Genetic Programming, 6th European Conference, EuroGP 2003, 2003

The Importance of Reuse and Development in Evolvable Hardware.
Proceedings of the 5th NASA / DoD Workshop on Evolvable Hardware (EH 2003), 2003

2002
Iterative Refinement Of Computational Circuits Using Genetic Programming.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming.
Proceedings of the Genetic Programming, 5th European Conference, 2002

Automatic Synthesis Using Genetic Programming of an Improved General-Purpose Controller for Industrially Representative Plants.
Proceedings of the 4th NASA / DoD Workshop on Evolvable Hardware (EH 2002), 2002


  Loading...