Content deleted Content added
Geysirhead (talk | contribs) |
Citation bot (talk | contribs) Add: doi-access, article-number, bibcode. Removed URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Jay8g | #UCB_toolbar |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 28:
* Molecular structure optimization (chemistry)
* Optimisation of data compression systems, for example using [[wavelet]]s.
* [[Power electronics]] design.<ref>{{Cite journal |url=http://www.cs.sysu.edu.cn/~jzhang/papers/SMCC.pdf |doi=10.1109/TSMCC.2005.855497 |access-date=2010-08-09 |archive-url=https://web.archive.org/web/20110707025618/http://www.cs.sysu.edu.cn/~jzhang/papers/SMCC.pdf |archive-date=2011-07-07 |url-status=dead |title=Pseudocoevolutionary genetic algorithms for power electronic circuits optimization |journal=IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews|volume=36 |issue=4 |pages=590–598 |year=2006 |last1=Jun Zhang |last2=Chung |first2=H.S.H. |last3=Lo |first3=W.L. |bibcode=2006ITHMS..36..590Z }}</ref>
* [[Traveling salesman problem]] and its applications<ref name="PCB"/>
* Stopping propagations, i.e. deciding how to cut edges in a graph so that some infectious condition (e.g. a disease, fire, computer virus, etc.) stops its spread. A bi-level genetic algorithm (i.e. a genetic algorithm where the fitness of each individual is calculated by running another genetic algorithm) was used due to the Σ<sup>P</sup><sub>2</sub>-completeness of the problem.<ref name="GRR">{{cite journal | last1 = Galiana| first1 = J.| last2 = Rodríguez| first2 = I. | last3 = Rubio| first3 = F. | year = 2023| title = How to stop undesired propagations by using bi-level genetic algorithms.
==Earth Sciences==
Line 47:
==Social Sciences==
*Design of [[anti-terrorism]] systems <ref name = "Buurman, Zhang & Babovic">{{cite journal |last1=Buurman |first1=J. |last2=Zhang |first2=S.X. |last3=Babovic |first3=V. |year=2009 |title=Reducing risk through real options in systems design: the case of architecting a maritime ___domain protection system |journal=Risk Analysis |volume=29 |issue=3 |pages=366–379 |doi= 10.1111/j.1539-6924.2008.01160.x|pmid=19076327 |bibcode=2009RiskA..29..366B |s2cid=36370133 |url=https://www.researchgate.net/publication/23657202}}</ref>
* Linguistic analysis, including [[grammar induction]] and other aspects of [[Natural language processing]] (NLP) such as [[word-sense disambiguation]].
* Finding the optimum subset of questions from a candidate pool of questions in psychological test design <ref name="VanDerLinde2018">{{cite journal |last1=van der Linde |first1=I. |last2=Bright |first2=P. |title=A genetic algorithm to find optimal reading test word subsets for estimating full-scale IQ |journal=PLOS ONE |year=2018 |volume=13 |issue=10 |pages=e0205754 |doi=10.1371/journal.pone.0205754 |bibcode=2018PLoSO..1305754V |doi-access=free }}
</ref>
==Industry, Management and Engineering==
Line 83 ⟶ 85:
* Biology and [[computational chemistry]]<ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-biology.html|title=Del Moral - Biology & Chemistry|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://web.archive.org/web/20120501080114/http://www.math.u-bordeaux1.fr/~delmoral/simu-biology.html|archive-date=2012-05-01|url-status=dead}}</ref><ref>{{Cite web |url=http://www.math.u-bordeaux1.fr/~delmoral/ihp.ps |title=an article on genetic particle models |access-date=2011-12-29 |archive-url=https://web.archive.org/web/20120501080256/http://www.math.u-bordeaux1.fr/~delmoral/ihp.ps |archive-date=2012-05-01 |url-status=dead }}</ref>
* Building [[phylogenetic tree]]s.<ref name="Hill">{{cite journal|vauthors=Hill T, Lundgren A, Fredriksson R, Schiöth HB | title = Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins | journal = Biochimica et Biophysica Acta (BBA) - General Subjects | year = 2005 | volume = 1725 | pages = 19–29 | pmid = 15990235|issue= 1|doi= 10.1016/j.bbagen.2005.04.027 }}</ref>
* [[Expression profiling|Gene expression profiling]] analysis.<ref name="To">{{cite journal|vauthors=To CC, Vohradsky J | title = A parallel genetic algorithm for single class pattern classification and its application for gene expression profiling in Streptomyces coelicolor | journal = BMC Genomics | year = 2007 | volume = 8 |
* [[Medicine]]: [[Clinical decision support]] in ophthalmology<ref>{{cite journal | title=Genetic Programming with Alternative Search Drivers for Detection of Retinal Blood Vessels |author1=Krzysztof Krawiec |author2=Mikołaj Pawlak | date=April 10, 2015 | url=https://www.researchgate.net/publication/272017132}}</ref> and oncology<ref>{{cite book | author=Fitzgerald, Jeannie, Ryan, Conor, Medernach, David and Krawiec, Krzysztof | title=Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation | chapter=An Integrated Approach to Stage 1 Breast Cancer Detection | date = July 15, 2015 | pages=1199–1206 | doi=10.1145/2739480.2754761 | isbn=9781450334723 | s2cid=14110665 | url=http://dl.acm.org/citation.cfm?id=2754761}}</ref>
* [[Computational Neuroscience]]: finding values for the maximal conductances of ion channels in biophysically detailed neuron models<ref>{{cite journal |last1=Van Geit |first1=Werner |last2=Gevaert |first2=Michael |last3=Chindemi |first3=Giuseppe |last4=Rössert |first4=Christian |last5=Courcol |first5=Jean-Denis |last6=Muller |first6=Eilif B. |last7=Schürmann |first7=Felix |last8=Segev |first8=Idan |last9=Markram |first9=Henry |title=BluePyOpt: Leveraging Open Source Software and Cloud Infrastructure to Optimise Model Parameters in Neuroscience |journal=Frontiers in Neuroinformatics |date=7 June 2016 |volume=10 |pages=17 |doi=10.3389/fninf.2016.00017|pmid=27375471 |pmc=4896051 |bibcode=2016arXiv160300500V |arxiv=1603.00500 |doi-access=free }}</ref>
| |||