Viral Search algorithm
The article, after a brief introduction on genetic algorithms and their functioning, presents a kind of genetic algorithm called Viral Search. We present the key concepts, we formally derive the algorithm and we perform numerical tests designed to illustrate the potential and limits.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Gardini, Matteo |
| description | The article, after a brief introduction on genetic algorithms and their
functioning, presents a kind of genetic algorithm called Viral Search. We
present the key concepts, we formally derive the algorithm and we perform
numerical tests designed to illustrate the potential and limits. |
| doi_str_mv | 10.48550/arxiv.1606.04306 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1606_04306</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1606_04306</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-87404348d141fdfd56ed2826d6d83a04bcd57187ec0db07ba747a605c78ebe573</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDlJdBSf7Aq0nbXJOVineQHCwuJbTJrWFFiWK6Nt7nf7t5xNiKiFWRmuYs3-091giYAwqBRyKybH13IUHx75qQu5OZ9_emn4kBjV3Vzf-NxD5aplnm2i3X2-zxS5iJIwMqfdGGSuVrG1tNTqbmAQtWpMyqLKymqQhV4EtgUomRYygKzKudJrSQMx-2y-suPi2Z_8sPsDiC0xf1Jkz-Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Viral Search algorithm</title><source>arXiv.org</source><creator>Gardini, Matteo</creator><creatorcontrib>Gardini, Matteo</creatorcontrib><description>The article, after a brief introduction on genetic algorithms and their
functioning, presents a kind of genetic algorithm called Viral Search. We
present the key concepts, we formally derive the algorithm and we perform
numerical tests designed to illustrate the potential and limits.</description><identifier>DOI: 10.48550/arxiv.1606.04306</identifier><language>eng</language><subject>Computer Science - Neural and Evolutionary Computing</subject><creationdate>2016-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1606.04306$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1606.04306$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gardini, Matteo</creatorcontrib><title>Viral Search algorithm</title><description>The article, after a brief introduction on genetic algorithms and their
functioning, presents a kind of genetic algorithm called Viral Search. We
present the key concepts, we formally derive the algorithm and we perform
numerical tests designed to illustrate the potential and limits.</description><subject>Computer Science - Neural and Evolutionary Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDlJdBSf7Aq0nbXJOVineQHCwuJbTJrWFFiWK6Nt7nf7t5xNiKiFWRmuYs3-091giYAwqBRyKybH13IUHx75qQu5OZ9_emn4kBjV3Vzf-NxD5aplnm2i3X2-zxS5iJIwMqfdGGSuVrG1tNTqbmAQtWpMyqLKymqQhV4EtgUomRYygKzKudJrSQMx-2y-suPi2Z_8sPsDiC0xf1Jkz-Q</recordid><startdate>20160614</startdate><enddate>20160614</enddate><creator>Gardini, Matteo</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20160614</creationdate><title>Viral Search algorithm</title><author>Gardini, Matteo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-87404348d141fdfd56ed2826d6d83a04bcd57187ec0db07ba747a605c78ebe573</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Neural and Evolutionary Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Gardini, Matteo</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gardini, Matteo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Viral Search algorithm</atitle><date>2016-06-14</date><risdate>2016</risdate><abstract>The article, after a brief introduction on genetic algorithms and their
functioning, presents a kind of genetic algorithm called Viral Search. We
present the key concepts, we formally derive the algorithm and we perform
numerical tests designed to illustrate the potential and limits.</abstract><doi>10.48550/arxiv.1606.04306</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1606.04306 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1606_04306 |
| source | arXiv.org |
| subjects | Computer Science - Neural and Evolutionary Computing |
| title | Viral Search algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T13%3A47%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Viral%20Search%20algorithm&rft.au=Gardini,%20Matteo&rft.date=2016-06-14&rft_id=info:doi/10.48550/arxiv.1606.04306&rft_dat=%3Carxiv_GOX%3E1606_04306%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |