Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...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| The most straightforward computation of the quartet distance would require <math>O(N^4)</math> time, where <math ...
    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
  • ...t1 = Felsenstein | first1 = J.| author-link1 = Joseph Felsenstein| title = Evolutionary trees from DNA sequences: A maximum likelihood approach | doi = 10.1007/BF0 ...n also be used to provide error estimates for the parameters describing an evolutionary tree. ...
    5 KB (827 words) - 16:27, 4 October 2024
  • {{Evolutionary algorithms}} * [[Evolutionary computation]] ...
    8 KB (1,096 words) - 10:26, 4 January 2025
  • In [[evolutionary computation]], '''Minimum Population Search''' ('''MPS''') is a computational method th |book-title=Congress on Evolutionary Computation (CEC'2013) ...
    9 KB (1,265 words) - 21:50, 1 August 2023
  • |book-title= IEEE Congress on Evolutionary Computation }}</ref> Like most of the methods in the area of [[evolutionary computation]], ICA does not need the gradient of the function in its optimization proce ...
    5 KB (726 words) - 06:46, 29 October 2024
  • ...=Automation of Linear and Nonlinear Control Systems Design by Evolutionary Computation |year=1995 |journal=IFAC Proceedings Volumes |pages=85–90 | last1 = Li | fi ...ng heuristic [[search algorithm|search techniques]] such as [[evolutionary computation]],<ref>{{cite journal |last1=Gregory S. Hornby |title=Generative Representa ...
    12 KB (1,633 words) - 10:57, 2 January 2025
  • | book-title = Genetic and Evolutionary Computation Conference (GECCO) ...e coordinate 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}} In [[evolutionary computing]] such as [[genetic algorithms]] and [[genetic programming]], ''' ...
    7 KB (1,145 words) - 10:53, 2 January 2025
  • .../><ref name=salge2013 /> As is the case with Bayesian methods in general, computation of empowerment becomes computationally expensive as the number of actions a ...mpowerment: A universal agent- centric measure of control. In Evolutionary Computation, 2005. The 2005 IEEE Congress on, volume 1, pages 128–135. IEEE.</ref> ...
    6 KB (912 words) - 16:03, 21 November 2024
  • ...e=Exhaustive Symbolic Regression|journal=IEEE Transactions on Evolutionary Computation |year=2023 |volume=28 |issue=4 |page=1 |doi=10.1109/TEVC.2023.3280250 |arxi ...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
  • ...tle=Evolutionary algorithms in theory and practice : evolution strategies, evolutionary programming, genetic algorithms|year=1995|publisher=Oxford University Press ...change/35824-multi-objective-optimization-using-evolution-strategies-es-as-evolutionary-algorithm-ea|publisher=Mathworks|access-date=1 November 2012}}</ref> which ...
    29 KB (4,219 words) - 22:59, 18 February 2025
  • {{Evolutionary algorithms}} The '''Fly Algorithm''' is a computational method within the field of [[evolutionary algorithms]], designed for direct exploration of [[three-dimensional space| ...
    31 KB (4,455 words) - 02:15, 13 November 2024
  • ...cause of [[genetic isolation]] between populations. [[Evolutionary biology|Evolutionary biologists]] and [[population genetics|population geneticists]] have been e ...right, can create genetic differentiation among subpopulations, leading to evolutionary change. Individuals within the subpopulation are neighbors in the sense tha ...
    14 KB (1,994 words) - 08:08, 10 February 2025
  • ...or, and D. Horn. "Optimal ensemble averaging of neural networks." Network: Computation in Neural Systems 8, no. 3 (1997): 283&ndash;296.</ref> ...k, and R. Doursat. "Neural networks and the bias/variance dilemma." Neural computation 4, no. 1 (1992): 1&ndash;58.</ref> The idea of combining experts can be tra ...
    6 KB (952 words) - 16:06, 18 November 2024
  • ...nion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation |chapter=Metaheuristics in nature-inspired algorithms |year=2014|pages=1419 ...
    5 KB (723 words) - 02:16, 9 February 2025
  • ...cussed.<ref>{{cite web |url=http://bilevel.org/applications/ |title=Scope: Evolutionary Bilevel Optimization |last1= |first1= |last2= |first2= |date= |website=www. ...ary Approaches and Applications |journal=IEEE Transactions on Evolutionary Computation |date=April 2018 |volume=22 |issue=2 |pages=276–295 |doi=10.1109/TEVC.2017. ...
    14 KB (2,090 words) - 06:52, 20 June 2024
  • ...ign 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
  • Depending on the used performance metric <math> m </math>, feature computation can be associated with costs. It is important to take the overhead of feature computation into account in practice in such scenarios; otherwise a misleading impressi ...
    15 KB (2,099 words) - 00:23, 4 April 2024
  • ...ch that compose these three branches are [[artificial neural networks]], [[evolutionary algorithms]], [[swarm intelligence]], [[artificial immune systems]], fracta ...s+Computation A Computable Universe: Understanding and Exploring Nature as Computation]. World Scientific Publishing Company, 2012</ref> exploring nature with hel ...
    44 KB (5,995 words) - 17:48, 7 September 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)