default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Schmidt 0001
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Other persons with the same name
- Michael D. Schmidt 0002 — University of Georgia, Department of Kinesiology, Athens, GA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[c13]Alexander Conway, Debadeepta Dey, Stefan Hackmann, Matthew Hausknecht, Michael Douglas Schmidt, Mark Steadman, Nick Volynets:
syftr: Pareto-Optimal Generative AI. AutoML 2025: 6/1-33- [i3]Alexander Conway, Debadeepta Dey, Stefan Hackmann, Matthew Hausknecht, Michael D. Schmidt, Mark Steadman, Nick Volynets:
syftr: Pareto-Optimal Generative AI. CoRR abs/2505.20266 (2025) - 2024
- [i2]Stefan Hackmann, Haniyeh Mahmoudian, Mark Steadman, Michael D. Schmidt:
Word Importance Explains How Prompts Affect Language Model Outputs. CoRR abs/2403.03028 (2024) - [i1]Scott Cheng-Hsin Yang, Baxter Eaves, Michael D. Schmidt, Ken Swanson, Patrick Shafto:
Structured Evaluation of Synthetic Tabular Data. CoRR abs/2403.10424 (2024)
2010 – 2019
- 2017
- [c12]Dylan Sherry, Michael D. Schmidt:
Performance testing of automated modeling for industrial applications. GECCO (Companion) 2017: 1605-1612 - 2011
- [c11]Michael Douglas Schmidt, Hod Lipson
:
Automated modeling of stochastic reactions with large measurement time-gaps. GECCO 2011: 307-314 - 2010
- [c10]Michael D. Schmidt, Hod Lipson:
Age-fitness pareto optimization. GECCO 2010: 543-544 - [c9]Michael D. Schmidt, Hod Lipson:
Predicting solution rank to improve performance. GECCO 2010: 949-956
2000 – 2009
- 2009
- [c8]Michael D. Schmidt, Hod Lipson:
Discovering a domain alphabet. GECCO 2009: 1083-1090 - [c7]Michael D. Schmidt, Hod Lipson:
Incorporating expert knowledge in evolutionary search: a study of seeding methods. GECCO 2009: 1091-1098 - [c6]Michael D. Schmidt, Hod Lipson:
Solving iterated functions using genetic programming. GECCO (Companion) 2009: 2149-2154 - 2008
- [j1]Michael D. Schmidt, Hod Lipson:
Coevolution of Fitness Predictors. IEEE Trans. Evol. Comput. 12(6): 736-749 (2008) - 2007
- [c5]Michael D. Schmidt, Hod Lipson:
Comparison of tree and graph encodings as function of problem complexity. GECCO 2007: 1674-1679 - [c4]Michael D. Schmidt, Hod Lipson:
Learning noise. GECCO 2007: 1680-1685 - 2006
- [c3]Michael D. Schmidt, Hod Lipson:
Actively probing and modeling users in interactive coevolution. GECCO 2006: 385-386 - 2003
- [c2]Thorsten May, Sascha Schneider, Michael D. Schmidt, Volker Luckas:
Fast scalar- & vectorfield visualization using a new progressive grid class. SimVis 2003: 89-102 - [c1]Sascha Schneider, Thorsten May, Michael D. Schmidt:
Rendering Large (Volume) Datasets: A new Parallel Visualization System. WSCG 2003
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 2026-04-19 01:12 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
