default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Vose
Person information
- affiliation: University of Tennessee, Knoxville, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j27]Edgar A. Duéñez-Guzmán
, Michael D. Vose:
No Free Lunch and Benchmarks. Evol. Comput. 21(2): 293-312 (2013)- 2011
- [c13]Jonathan E. Rowe, Michael D. Vose:
Unbiased black box search algorithms. GECCO 2011: 2035-2042 - 2010
- [j26]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Representation Invariant Genetic Operators. Evol. Comput. 18(4): 635-660 (2010) - [c12]Michael D. Vose:
Course notes: genetic algorithm theory. GECCO (Companion) 2010: 2647-2660
2000 – 2009
- 2009
- [j25]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Reinterpreting No Free Lunch. Evol. Comput. 17(1): 117-129 (2009) - 2007
- [c11]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Neighborhood Graphs and Symmetric Genetic Operators. FOGA 2007: 110-122 - [c10]Michael D. Vose, L. Darrell Whitley:
No free lunch. GECCO (Companion) 2007: 3734-3764 - 2006
- [j24]Michael D. Vose:
Preface. Theor. Comput. Sci. 361(1): 1 (2006) - [j23]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Differentiable coarse graining. Theor. Comput. Sci. 361(1): 111-129 (2006) - [e5]Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose:
Theory of Evolutionary Algorithms, 15.-20. February 2004. Dagstuhl Seminar Proceedings 04081, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e4]Dirk V. Arnold, Thomas Jansen, Michael D. Vose, Jonathan E. Rowe:
Theory of Evolutionary Algorithms, 05.02. - 10.02.2006. Dagstuhl Seminar Proceedings 06061, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i3]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Executive Summary -- Theory of Evolutionary Algoritms. Theory of Evolutionary Algorithms 2006 - [i2]Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, Michael D. Vose:
06061 Abstracts Collection -- Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2006 - 2005
- [j22]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
State Aggregation and Population Dynamics in Linear Systems. Artif. Life 11(4): 473-492 (2005) - [c9]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Coarse Graining Selection and Mutation. FOGA 2005: 176-191 - [e3]Alden H. Wright, Michael D. Vose, Kenneth A. De Jong, Lothar M. Schmitt:
Foundations of Genetic Algorithms, 8th International Workshop, FOGA 2005, Aizu-Wakamatsu City, Japan, January 5-9, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3469, Springer 2005, ISBN 3-540-27237-2 [contents] - 2004
- [j21]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Structural Search Spaces and Genetic Operators. Evol. Comput. 12(4): 461-493 (2004) - [i1]Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose:
04081 Abstracts Collection - Theory of Evolutionary Algorithms. Theory of Evolutionary Algorithms 2004 - 2003
- [c8]Alden H. Wright, Michael D. Vose, Jonathan E. Rowe:
Implicit Parallelism. GECCO 2003: 1505-1517 - 2002
- [j20]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Group Properties of Crossover and Mutation. Evol. Comput. 10(2): 151-184 (2002)
1990 – 1999
- 1999
- [b1]Michael D. Vose:
The simple genetic algorithm - foundations and theory. Complex adaptive systems, MIT Press 1999, ISBN 978-0-262-22058-3, pp. I-IX, 1-251 - [j19]Michael D. Vose:
Random Heuristic Search. Theor. Comput. Sci. 229(1): 103-142 (1999) - 1998
- [j18]Michael D. Vose, Alden H. Wright:
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory. Evol. Comput. 6(3): 253-273 (1998) - [j17]Michael D. Vose, Alden H. Wright:
The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse. Evol. Comput. 6(3): 275-289 (1998) - [c7]Michael D. Vose, L. Darrell Whitley:
A Formal Language for Permutation Recombination Operators. FOGA 1998: 135-145 - 1997
- [j16]Gary J. Koehler, Michael D. Vose, Siddhartha Bhattacharyya:
General Cardinality Genetic Algorithms. Evol. Comput. 5(4): 439-459 (1997) - [e2]Richard K. Belew, Michael D. Vose:
Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, CA, USA, August 5 1996. Morgan Kaufmann 1997, ISBN 1-55860-460-X [contents] - 1996
- [j15]Michael D. Vose:
Logarithmic Convergence of Random Heuristic Search. Evol. Comput. 4(4): 395-404 (1996) - 1995
- [j14]Alden H. Wright, Michael D. Vose:
Finiteness of the Fixed Point Set for the Simple Genetic Algorithm. Evol. Comput. 3(3): 299-309 (1995) - [j13]Michael D. Vose:
Modeling Simple Genetic Algorithms. Evol. Comput. 3(4): 453-472 (1995) - [e1]L. Darrell Whitley, Michael D. Vose:
Proceedings of the Third Workshop on Foundations of Genetic Algorithms. Estes Park, Colorado, USA, July 31 - August 2 1994. Foundations of Genetic Algorithms, Morgan Kaufmann 1995, ISBN 1-55860-356-5 [contents] - 1994
- [j12]Jenny Juliany, Michael D. Vose:
The Genetic Algorithm Fractal. Evol. Comput. 2(2): 165-180 (1994) - [j11]Michael D. Vose, Alden H. Wright:
Simple Genetic Algorithms with Linear Fitness. Evol. Comput. 2(4): 347-368 (1994) - [c6]Michael D. Vose, Alden H. Wright:
Stability of Vertex Fixed Points and Applications. FOGA 1994: 103-113 - 1993
- [j10]David L. Battle, Michael D. Vose:
Isomorphisms of Genetic Algorithms. Artif. Intell. 60(1): 155-165 (1993) - [j9]Michael D. Vose:
A Closer Look at Mutation in Genetic Algorithms. Ann. Math. Artif. Intell. 10(4): 423-434 (1993) - [c5]Jenny Juliany, Michael D. Vose:
The Genetic Algorithm Fractal. ICGA 1993: 639 - 1992
- [j8]Gunar E. Liepins, Michael D. Vose:
Characterizing Crossover in Genetic Algorithms. Ann. Math. Artif. Intell. 5(1): 27-34 (1992) - [j7]Allen E. Nix, Michael D. Vose:
Modeling Genetic Algorithms with Markov Chains. Ann. Math. Artif. Intell. 5(1): 77-88 (1992) - [c4]Michael D. Vose:
Modeling Simple Genetic Algorithms. FOGA 1992: 63-73 - 1991
- [j6]Michael D. Vose:
Determining Concepts by Group Membership. Appl. Algebra Eng. Commun. Comput. 2: 139-146 (1991) - [j5]Michael D. Vose:
Generalizing the Notion of Schema in Genetic Algorithms. Artif. Intell. 50(3): 385-396 (1991) - [j4]Gunar E. Liepins, Michael D. Vose:
Polynomials, Basis Sets, and Deceptiveness in Genetic Algorithms. Complex Syst. 5(1) (1991) - [j3]Michael D. Vose, Gunar E. Liepins:
Punctuated Equilibria in Genetic Search. Complex Syst. 5(1) (1991) - [j2]Michael D. Vose:
A Linear Algorithm For Generating Random Numbers With a Given Distribution. IEEE Trans. Software Eng. 17(9): 972-975 (1991) - [c3]Michael D. Vose, Gunar E. Liepins:
Schema Disruption. ICGA 1991: 237-243 - 1990
- [j1]Gunar E. Liepins, Michael D. Vose:
Representational issues in genetic optimization. J. Exp. Theor. Artif. Intell. 2(2): 101-115 (1990) - [c2]Gunar E. Liepins, Michael D. Vose:
Deceptiveness and Genetic Algorithm Dynamics. FOGA 1990: 36-50 - [c1]David L. Battle, Michael D. Vose:
Isomorphisms of Genetic Algorithms. FOGA 1990: 242-251
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 22:46 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:
