Switch to: References

Add citations

You must login to add citations.
  1. When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not.Andrei Lissovoi, Pietro S. Oliveto & John Alasdair Warwicker - 2023 - Artificial Intelligence 314 (C):103804.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An analysis on recombination in multi-objective evolutionary optimization.Chao Qian, Yang Yu & Zhi-Hua Zhou - 2013 - Artificial Intelligence 204 (C):99-119.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the approximation ability of evolutionary optimization with application to minimum set cover.Yang Yu, Xin Yao & Zhi-Hua Zhou - 2012 - Artificial Intelligence 180-181 (C):20-33.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Towards an analytic framework for analysing the computation time of evolutionary algorithms.Jun He & Xin Yao - 2003 - Artificial Intelligence 145 (1-2):59-97.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms.Chao Qian, Yang Yu, Ke Tang, Xin Yao & Zhi-Hua Zhou - 2019 - Artificial Intelligence 275 (C):279-294.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Backward-chaining evolutionary algorithms.Riccardo Poli & William B. Langdon - 2006 - Artificial Intelligence 170 (11):953-982.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Erratum to: Drift analysis and average time complexity of evolutionary algorithms.Jun He & Xin Yao - 2002 - Artificial Intelligence 140 (1-2):245-248.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Practical performance models of algorithms in evolutionary program induction and other domains.Mario Graff & Riccardo Poli - 2010 - Artificial Intelligence 174 (15):1254-1276.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • A new approach to estimating the expected first hitting time of evolutionary algorithms.Yang Yu & Zhi-Hua Zhou - 2008 - Artificial Intelligence 172 (15):1809-1832.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6d5f778f9-5rvcg uwo