Found 60 Documents (Results 1–60)
Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function. (English) Zbl 07891492
Dynamic exploration-exploitation Pareto approach for high-dimensional expensive black-box optimization. (English) Zbl 07877705
MSC:
90Bxx
More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments. (English) Zbl 07795030
Runtime analysis of a co-evolutionary algorithm. Overcoming negative drift in maximin-optimisation. (English) Zbl 07809166
Chicano, Francisco (ed.) et al., Proceedings of the 17th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2023, Potsdam, Germany, August 30 – September 1, 2023. New York, NY: Association for Computing Machinery (ACM). 73-83 (2023).
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. (English) Zbl 07676461
MSC:
68Qxx
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions. (English) Zbl 1537.68228
Do additional optima speed up evolutionary algorithms? (English) Zbl 1507.68350
Proceedings of the 16th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2021, virtual event, Dornbirn, Austria, September 6–8, 2021. New York, NY: Association for Computing Machinery (ACM). Article No. 8, 11 p. (2021).
On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. (English) Zbl 07526445
Proceedings of the 16th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2021, virtual event, Dornbirn, Austria, September 6–8, 2021. New York, NY: Association for Computing Machinery (ACM). Article No. 2, 15 p. (2021).
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax. (English) Zbl 1443.68228
Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints. (English) Zbl 1443.68227
A multi-strategy enhanced sine cosine algorithm for global optimization and constrained practical engineering problems. (English) Zbl 1433.90121
An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. (English) Zbl 1433.68643
Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27–29, 2019. New York, NY: Association for Computing Machinery (ACM). 25-33 (2019).
On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. (English) Zbl 1421.68155
Single-solution simulated Kalman filter algorithm for global optimisation problems. (English) Zbl 1397.90304
Static and self-adjusting mutation strengths for multi-valued decision variables. (English) Zbl 1390.68593
Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm. (English) Zbl 1391.68100
Towards implementation of a generalized architecture for high-level quantum programming language. (English) Zbl 1383.81052
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax. (English) Zbl 1365.68391
Proceedings of the 14th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2017, Copenhagen, Denmark, January 12–15, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4651-1). 65-79 (2017).
Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems. (English) Zbl 1360.68791
Reviewer: Manfred Kerber (Birmingham)
Insights from adversarial fitness functions. (English) Zbl 1360.90304
Proceedings of the 13th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2015, Aberystwyth, UK, January 17–20, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3434-1). 25-39 (2015).
On the black-box complexity of example functions: the real jump function. (English) Zbl 1361.68200
Proceedings of the 13th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2015, Aberystwyth, UK, January 17–20, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3434-1). 16-24 (2015).
Black-box complexity of parallel search with distributed populations. (English) Zbl 1361.68103
Proceedings of the 13th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2015, Aberystwyth, UK, January 17–20, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3434-1). 3-15 (2015).
Multiobjective optimization: when objectives exhibit non-uniform latencies. (English) Zbl 1346.90727
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. (English) Zbl 1338.90259
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory. (English) Zbl 1401.91036
Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 188-199 (2015).
Black-box complexity for bounding the performance of randomized search heuristics. (English) Zbl 1328.68197
Borenstein, Yossi (ed.) et al., Theory and principled methods for the design of metaheuristics. Berlin: Springer (ISBN 978-3-642-33205-0/hbk; 978-3-642-33206-7/ebook). Natural Computing Series, 85-110 (2014).
Running time analysis of ant colony optimization for shortest path problems. (English) Zbl 1250.68238
Reviewer: Thomas Jansen (Cork)
Non-uniform mutation rates for problems with unknown solution lengths. (English) Zbl 1369.68301
Proceedings of the 11th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2011, Schwarzenberg, Austria, January 5–9, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0633-1). 173-180 (2011).
Faster black-box algorithms through higher arity operators. (English) Zbl 1369.68238
Proceedings of the 11th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2011, Schwarzenberg, Austria, January 5–9, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0633-1). 163-172 (2011).
Using Markov-chain mixing time estimates for the analysis of ant colony optimization. (English) Zbl 1369.68331
Proceedings of the 11th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2011, Schwarzenberg, Austria, January 5–9, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0633-1). 139-150 (2011).
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity. (English) Zbl 1330.68110
Kulikov, Alexander (ed.) et al., Computer science – theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 15-28 (2011).
Simplified drift analysis for proving lower bounds in evolutionary computation. (English) Zbl 1211.68521
Analyzing different variants of immune inspired somatic contiguous hypermutations. (English) Zbl 1209.90358
MSC:
90C59
Theoretical analysis of local search in software testing. (English) Zbl 1260.68121
Watanabe, Osamu (ed.) et al., Stochastic algorithms: Foundations and applications. 5th international symposium, SAGA 2009, Sapporo, Japan, October 26–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04943-9/pbk). Lecture Notes in Computer Science 5792, 156-168 (2009).
Lower bounds for randomized direct search with isotropic sampling. (English) Zbl 1152.90668
MSC:
90C59
Lower bounds for local search by quantum arguments. (English) Zbl 1192.68256
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 465-474, electronic only (2004).
Filter Results by …
Document Type
- Journal Articles (44)
- Collection Articles (16)
all
top 5
Author
- Doerr, Benjamin (18)
- Lehre, Per Kristian (9)
- Doerr, Carola (8)
- Witt, Carsten (8)
- Sudholt, Dirk (7)
- Winzen, Carola (6)
- Kötzing, Timo (5)
- Friedrich, Tobias (4)
- Jansen, Thomas (4)
- Krejca, Martin S. (3)
- Badkobeh, Golnaz (2)
- Bossek, Jakob (2)
- Dang, Duc-Cuong (2)
- Lengler, Johannes (2)
- Neumann, Frank (2)
- Sutton, Andrew M. (2)
- Thyssen, Christian (2)
- Zheng, Weijie (2)
- Aaronson, Scott (1)
- Ab Aziz, Nor Azlina (1)
- Abdul Aziz, Nor Hidayati (1)
- Afshani, Peyman (1)
- Agrawal, Manindra (1)
- Akimoto, Youhei (1)
- Ali, Hesham A. (1)
- Allmendinger, Richard W. (1)
- Ameen, El-Mahdy M. (1)
- Anahideh, Hadis (1)
- Antipov, Denis (1)
- Arcuri, Andrea (1)
- Astete-Morales, Sandra (1)
- Badawy, Mahmoud (1)
- Barton, Nick H. (1)
- Baskar, Amaladosan (1)
- Cathabard, Stephan (1)
- Chen, Huiling (1)
- Çörüş, Doğan (1)
- Dietzfelbinger, Martin (1)
- Ebel, Franziska (1)
- Handl, Julia (1)
- Hevia Fajardo, Mario Alejandro (1)
- Ibrahim, Zuwairie (1)
- Jäger, Gerold (1)
- Jägersküpper, Jens (1)
- Johannsen, Daniel (1)
- Karavaev, Vitalii (1)
- Kelley, Andrew James (1)
- Knowles, Joshua D. (1)
- Lagodzinski, J. A. Gregor (1)
- Larsen, Kasper Green (1)
- Lin, Shishen (1)
- Lockett, Alan J. (1)
- Mehlhorn, Kurt (1)
- Mohamad, Mohd Saberi (1)
- Nezami, Nazanin (1)
- Oliveto, Pietro Simone (1)
- Paixão, Tiago (1)
- Peczarski, Marcin Piotr (1)
- Qin, Xiaoyu (1)
- Rowe, Jonathan E. (1)
- Salem, Mofreh M. (1)
- Schirneck, Martin (1)
- Storch, Tobias (1)
- Teytaud, Olivier (1)
- Trubenová, Barbora (1)
- Wagner, Markus (1)
- Wang, Mingjing (1)
- Wang, Shouda (1)
- Watada, Junzo (1)
- Wegener, Ingo (1)
- Woelfel, Philipp (1)
- Yang, Jing (1)
- Yao, Xin (1)
- Zarges, Christine (1)
- Zhao, Xuehua (1)
all
top 5
Serial
- Algorithmica (15)
- Theor. Comput. Sci. (13)
- Inf. Process. Lett. (2)
- Artif. Intell. (1)
- Discrete Appl. Math. (1)
- Int. J. Theor. Phys. (1)
- Appl. Math. Comput. (1)
- Oper. Res. Lett. (1)
- Inf. Comput. (1)
- Comput. Oper. Res. (1)
- Eur. J. Oper. Res. (1)
- Comb. Probab. Comput. (1)
- Theory Comput. Syst. (1)
- RAIRO, Oper. Res. (1)
- Sādhanā (1)
- J. Discrete Algorithms (1)
- J. Theor. Biol. (1)
all
top 3
Software
- NSGA-II (2)
- AHA (1)
- ALO (1)
- AOA (1)
- AntNet (1)
- BoTorch (1)
- CEC 13 (1)
- COCO (1)
- Cornell-MOE (1)
- Differential Evolution (1)
- ECJ (1)
- EGO (1)
- GALib (1)
- GOA (1)
- GPyTorch (1)
- GSA (1)
- GWO (1)
- GenProg (1)
- GitHub (1)
- Google vizier (1)
- Hypervolume Indicator (1)
- JADE (1)
- KEEL (1)
- MLMSRBF (1)
- MOALO (1)
- QPL (1)
- R (1)
- SMS-EMOA (1)
- SPEA2 (1)
- Scikit (1)
- WOA (1)
- jMetal (1)
- qGCL (1)
