default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew J. Streeter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c25]Luis von Ahn, Matthew J. Streeter:
Behind the Scenes of Duolingo. EDM 2015: 3- [c24]Matthew J. Streeter:
Mixture Modeling of Individual Learning Curves. EDM 2015: 45-52 - 2014
- [c23]H. Brendan McMahan, Matthew J. Streeter:
Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning. NIPS 2014: 2915-2923 - [i7]Daniel Golovin, Andreas Krause, Matthew J. Streeter:
Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments. CoRR abs/1407.1082 (2014) - 2012
- [c22]Matthew J. Streeter, H. Brendan McMahan:
No-Regret Algorithms for Unconstrained Online Convex Optimization. NIPS 2012: 2411-2419 - [c21]H. Brendan McMahan, Matthew J. Streeter:
Open Problem: Better Bounds for Online Logistic Regression. COLT 2012: 44.1-44.3 - [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)
2000 – 2009
- 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. 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 - [p1]John R. Koza, Martin A. Keane, Matthew J. Streeter, Sameer H. Al-Sakran, Lee W. Jones:
Human-Competitive Evolvable Hardware Created by Means of Genetic Programming. Evolvable Hardware 2006: 173-197 - 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. Artif. Intell. Eng. Des. Anal. Manuf. 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 Intell. Syst. 18(3): 25-31 (2003) - [j1]Matthew J. Streeter, Lee A. Becker:
Automated Discovery of Numerical Approximation Formulae via Genetic Programming. Genet. Program. Evolvable Mach. 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]Matthew J. Streeter:
The Root Causes of Code Growth in Genetic Programming. EuroGP 2003: 443-454 - [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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
