default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Mitavskiy
Person information
- affiliation: University of Sheffield, School of Medicine
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c11]Jun He
, Boris Mitavskiy, Yuren Zhou:
A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem. IEEE Congress on Evolutionary Computation 2014: 141-148- [i9]Jun He, Boris Mitavskiy, Yuren Zhou:
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem. CoRR abs/1404.3520 (2014) - 2013
- [j8]Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He:
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning. Nat. Comput. 12(4): 473-484 (2013) - [c10]Boris Mitavskiy, Jun He:
Combining drift analysis and generalized schema theory to design efficient hybrid and/or mixed strategy EAs. IEEE Congress on Evolutionary Computation 2013: 2028-2036 - [c9]Elio Tuci, Boris Mitavskiy, Gianpiero Francesca:
On the evolution of self-organised role-allocation and role-switching behaviour in swarm robotics: a case study. ECAL 2013: 379-386 - [c8]Boris Mitavskiy, Jun He:
A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers. FOGA 2013: 133-146 - [i8]Boris Mitavskiy, Jun He:
Combining Drift Analysis and Generalized Schema Theory to Design Efficient Hybrid and/or Mixed Strategy EAs. CoRR abs/1305.2490 (2013) - [i7]Boris Mitavskiy, Jun He:
A Further Generalization of the Finite-Population Geiringer-like Theorem for POMDPs to Allow Recombination Over Arbitrary Set Covers. CoRR abs/1305.2498 (2013) - [i6]Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He:
Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning. CoRR abs/1305.2504 (2013) - [i5]Boris Mitavskiy, Jun He:
Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments. CoRR abs/1312.1273 (2013) - 2012
- [j7]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information. Int. J. Intell. Comput. Cybern. 5(1): 36-90 (2012) - [c7]Boris Mitavskiy, Jun He:
A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm. IEEE Congress on Evolutionary Computation 2012: 1-8 - [i4]Boris Mitavskiy, Jun He:
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm. CoRR abs/1202.1708 (2012) - 2011
- [i3]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information. CoRR abs/1110.4657 (2011)
2000 – 2009
- 2009
- [j6]Boris Mitavskiy, Chris Cannings:
Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms. Evol. Comput. 17(3): 343-377 (2009) - [j5]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. Int. J. Intell. Comput. Cybern. 2(2): 243-284 (2009) - 2008
- [j4]Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt:
Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm. Genet. Program. Evolvable Mach. 9(2): 109-123 (2008) - [c6]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links. IEEE Congress on Evolutionary Computation 2008: 1484-1491 - [i2]Boris Mitavskiy, Chris Cannings:
Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases. Theory of Evolutionary Algorithms 2008 - 2007
- [c5]Boris Mitavskiy, Chris Cannings:
An improvement of the "quotient construction" method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2606-2613 - 2006
- [j3]Boris Mitavskiy, Jonathan E. Rowe:
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms. Evol. Comput. 14(1): 87-118 (2006) - [j2]Boris Mitavskiy, Jonathan E. Rowe:
Some results about the Markov chains associated to GPs and general EAs. Theor. Comput. Sci. 361(1): 72-110 (2006) - [c4]Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt:
Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm. SEAL 2006: 726-733 - [i1]Boris Mitavskiy, Jonathan E. Rowe:
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?. Theory of Evolutionary Algorithms 2006 - 2005
- [c3]Andreas Blass, Boris Mitavskiy:
NP-Completeness of Deciding Binary Genetic Encodability. FOGA 2005: 58-74 - [c2]Boris Mitavskiy, Jonathan E. Rowe:
A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover. FOGA 2005: 156-175 - 2004
- [b1]Boris Mitavskiy:
A mathematical model of evolutionary computation and some consequences. University of Michigan, USA, 2004 - [j1]Boris Mitavskiy:
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms. Evol. Comput. 12(1): 19-46 (2004) - 2003
- [c1]Boris Mitavskiy:
Comparing Evolutionary Computation Techniques via Their Representation. GECCO 2003: 1196-1209
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:11 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:
