Search results
Jump to navigation
Jump to search
- ...itle=Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units|journal=Systematic Zoology|date=1985|volume=34|issue=2|pages=193–200| |title=Computing the quartet distance between evolutionary trees ...3 KB (469 words) - 17:46, 5 May 2021
- '''Reward-based selection''' is a technique used in [[evolutionary algorithm]]s for selecting potentially useful solutions for recombination. |book-title = Evolutionary Multi-Criterion Optimization 2011 (EMO 2011) ...3 KB (486 words) - 17:41, 31 December 2024
- | book-title = Genetic and Evolutionary Computation Conference (GECCO) ...descent was shown to be competitive to the state-of-the-art [[evolutionary algorithms]] and has the following invariance properties: ...4 KB (559 words) - 04:05, 5 October 2024
- {{Evolutionary algorithms}} ...ution strategies''' ('''NES''') are a family of [[numerical optimization]] algorithms for [[black box]] problems. Similar in spirit to [[evolution strategies]], ...8 KB (1,096 words) - 10:26, 4 January 2025
- {{Evolutionary algorithms}} In [[evolutionary computing]] such as [[genetic algorithms]] and [[genetic programming]], '''propagation''' refers to the inheritance ...7 KB (1,145 words) - 10:53, 2 January 2025
- ...It is commonly employed to evaluate the performance of global optimization algorithms. ...re several variants of the Griewank function specifically designed to test algorithms in high-dimensional optimization scenarios.<ref>Locatelli, M. "A Note on th ...4 KB (573 words) - 12:57, 19 February 2025
- In [[evolutionary computation]], '''Minimum Population Search''' ('''MPS''') is a computation ...tc/> and [[Estimation of distribution algorithm|Estimation of Distribution Algorithms]]. ...9 KB (1,265 words) - 21:50, 1 August 2023
- ...um Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms|journal=SIAM Journal on Computing|volume=26|issue=6|pages=1656–1669|doi=10. ...for Comparing Trees via Unbalanced Bipartite Matchings|journal=Journal of Algorithms|date=August 2001|volume=40|issue=2|pages=212–233|doi=10.1006/jagm.2001.1163 ...3 KB (416 words) - 03:52, 20 January 2025
- ...me=28 | title=Automation of Linear and Nonlinear Control Systems Design by Evolutionary Computation |year=1995 |journal=IFAC Proceedings Volumes |pages=85–90 | las .../ref> including heuristic [[search algorithm|search techniques]] such as [[evolutionary computation]],<ref>{{cite journal |last1=Gregory S. Hornby |title=Generativ ...12 KB (1,633 words) - 10:57, 2 January 2025
- In [[computer science]], '''imperialist competitive algorithms''' are a type of computational method used to solve [[optimization problem] |book-title= IEEE Congress on Evolutionary Computation ...5 KB (726 words) - 06:46, 29 October 2024
- {{Short description|Functions used to evaluate optimization algorithms}} ...cial landscapes''', are useful to evaluate characteristics of optimization algorithms, such as [[Rate of convergence|convergence rate]], precision, robustness an ...29 KB (4,219 words) - 22:59, 18 February 2025
- ...f>{{cite book |first=X. S. |last=Yang |title=Nature-Inspired Metaheuristic Algorithms |publisher=[[Luniver Press]] |year=2008 |isbn=978-1-905986-10-1 }}</ref> ...ic and Evolutionary Computation |chapter=Metaheuristics in nature-inspired algorithms |year=2014|pages=1419–1422|chapter-url=http://www.macs.hw.ac.uk/~ml355/comm ...5 KB (723 words) - 02:16, 9 February 2025
- ...in the form of an unrooted binary tree, representing the similarities and evolutionary history among species of [[Actinomycetota|actinobacteria]].]] ...applications of unrooted binary trees in [[hierarchical clustering]] and [[evolutionary tree]] reconstruction, unordered trees are more common.<ref name="f84"/> ...14 KB (2,089 words) - 04:40, 5 October 2024
- ...d with [[differential evolution]] to obtain better results than individual algorithms on a common set of benchmark problems.<ref name="CGOS14">{{cite journal |la ...gineering design problems by social cognitive optimization]. ''Genetic and Evolutionary Computation Conference'' (GECCO), Seattle, WA, USA: 261-262.</ref> ...6 KB (967 words) - 00:32, 10 October 2021
- ...t3=Pedro|title=Exhaustive Symbolic Regression|journal=IEEE Transactions on Evolutionary Computation |year=2023 |volume=28 |issue=4 |page=1 |doi=10.1109/TEVC.2023.3 ...s characteristic of symbolic regression also has advantages: because the [[evolutionary algorithm]] requires diversity in order to effectively explore the search s ...20 KB (2,610 words) - 14:10, 4 January 2025
- ...search algorithms<ref>{{citation|title=Predicate-Oriented Database Search Algorithms.|url=https://archive.org/details/DTIC_ADA110139/mode/2up|access-date=2024-0 ...d as a computer scientist, Willard's most highly cited publication is in [[evolutionary biology]]. In 1973, with biologist [[Robert Trivers]], Willard published th ...11 KB (1,369 words) - 04:06, 18 June 2024
- ...-authored with Robert Irving, ''The Stable Marriage Problem: Structure and Algorithms''.<ref name=stable>{{cite book | title = The stable marriage problem: structure and algorithms ...15 KB (2,010 words) - 07:41, 31 December 2024
- {{Evolutionary algorithms}} ...Algorithm''' is a computational method within the field of [[evolutionary algorithms]], designed for direct exploration of [[three-dimensional space|3D spaces]] ...31 KB (4,455 words) - 02:15, 13 November 2024
- ...t1=Yang|first1=Li|title=On hyperparameter optimization of machine learning algorithms: Theory and practice|journal=Neurocomputing|year=2020|volume=415|pages=295– | title = Algorithms for hyper-parameter optimization ...24 KB (3,192 words) - 04:38, 30 January 2025
- ...cussed.<ref>{{cite web |url=http://bilevel.org/applications/ |title=Scope: Evolutionary Bilevel Optimization |last1= |first1= |last2= |first2= |date= |website=www. ...l optimization problems to optimization problems for which robust solution algorithms are available. [[Extended Mathematical Programming (EMP)]] is an extension ...14 KB (2,090 words) - 06:52, 20 June 2024