Coarse Graining Selection and Mutation
Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered in...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 191 |
|---|---|
| container_issue | |
| container_start_page | 176 |
| container_title | |
| container_volume | |
| creator | Rowe, Jonathan E. Vose, Michael D. Wright, Alden H. |
| description | Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained. |
| doi_str_mv | 10.1007/11513575_10 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17026662</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17026662</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-392b46ad740b16e254f457ba2b2ccdd945a064fbf9218c0c4a381b84ac4ced793</originalsourceid><addsrcrecordid>eNpNkDtPw0AQhI-XRAiu-ANuQKIw7N7ew1ciCwJSEAVQW3vnc2QIduQLBf8eR6FgmtFoRlN8Qlwg3CCAvUXUSNrqGuFAnJFWQBJIw6GYoUEsiJQ7Epmz5a6TVpKlYzEDAlk4q-hUZCl9wCRCaw3MxFU18Jhivhi567t-lb_GdQzbbuhz7pv8-XvLu3AuTlpep5j9-Vy8P9y_VY_F8mXxVN0ti41Ety3ISa8MN1aBRxOlVq3S1rP0MoSmcUozGNX61kksAwTFVKIvFQcVYmMdzcXl_nfDKfC6HbkPXao3Y_fF40-NFqQxRk676_0uTVW_imPth-EzTVzqHaj6Hyj6BZJ3U20</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Coarse Graining Selection and Mutation</title><source>Springer Books</source><creator>Rowe, Jonathan E. ; Vose, Michael D. ; Wright, Alden H.</creator><contributor>Schmitt, Lothar M. ; Wright, Alden H. ; De Jong, Kenneth A. ; Vose, Michael D.</contributor><creatorcontrib>Rowe, Jonathan E. ; Vose, Michael D. ; Wright, Alden H. ; Schmitt, Lothar M. ; Wright, Alden H. ; De Jong, Kenneth A. ; Vose, Michael D.</creatorcontrib><description>Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540272373</identifier><identifier>ISBN: 3540272372</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320350</identifier><identifier>EISBN: 9783540320357</identifier><identifier>DOI: 10.1007/11513575_10</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Coarse Graining ; Computer science; control theory; systems ; Equivalence Class ; Equivalence Relation ; Exact sciences and technology ; Genetic Algorithm ; Simple Genetic Algorithm ; Theoretical computing</subject><ispartof>Foundations of Genetic Algorithms, 2005, p.176-191</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11513575_10$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11513575_10$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17026662$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Schmitt, Lothar M.</contributor><contributor>Wright, Alden H.</contributor><contributor>De Jong, Kenneth A.</contributor><contributor>Vose, Michael D.</contributor><creatorcontrib>Rowe, Jonathan E.</creatorcontrib><creatorcontrib>Vose, Michael D.</creatorcontrib><creatorcontrib>Wright, Alden H.</creatorcontrib><title>Coarse Graining Selection and Mutation</title><title>Foundations of Genetic Algorithms</title><description>Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Coarse Graining</subject><subject>Computer science; control theory; systems</subject><subject>Equivalence Class</subject><subject>Equivalence Relation</subject><subject>Exact sciences and technology</subject><subject>Genetic Algorithm</subject><subject>Simple Genetic Algorithm</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540272373</isbn><isbn>3540272372</isbn><isbn>3540320350</isbn><isbn>9783540320357</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkDtPw0AQhI-XRAiu-ANuQKIw7N7ew1ciCwJSEAVQW3vnc2QIduQLBf8eR6FgmtFoRlN8Qlwg3CCAvUXUSNrqGuFAnJFWQBJIw6GYoUEsiJQ7Epmz5a6TVpKlYzEDAlk4q-hUZCl9wCRCaw3MxFU18Jhivhi567t-lb_GdQzbbuhz7pv8-XvLu3AuTlpep5j9-Vy8P9y_VY_F8mXxVN0ti41Ety3ISa8MN1aBRxOlVq3S1rP0MoSmcUozGNX61kksAwTFVKIvFQcVYmMdzcXl_nfDKfC6HbkPXao3Y_fF40-NFqQxRk676_0uTVW_imPth-EzTVzqHaj6Hyj6BZJ3U20</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Rowe, Jonathan E.</creator><creator>Vose, Michael D.</creator><creator>Wright, Alden H.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Coarse Graining Selection and Mutation</title><author>Rowe, Jonathan E. ; Vose, Michael D. ; Wright, Alden H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-392b46ad740b16e254f457ba2b2ccdd945a064fbf9218c0c4a381b84ac4ced793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Coarse Graining</topic><topic>Computer science; control theory; systems</topic><topic>Equivalence Class</topic><topic>Equivalence Relation</topic><topic>Exact sciences and technology</topic><topic>Genetic Algorithm</topic><topic>Simple Genetic Algorithm</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rowe, Jonathan E.</creatorcontrib><creatorcontrib>Vose, Michael D.</creatorcontrib><creatorcontrib>Wright, Alden H.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rowe, Jonathan E.</au><au>Vose, Michael D.</au><au>Wright, Alden H.</au><au>Schmitt, Lothar M.</au><au>Wright, Alden H.</au><au>De Jong, Kenneth A.</au><au>Vose, Michael D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Coarse Graining Selection and Mutation</atitle><btitle>Foundations of Genetic Algorithms</btitle><date>2005</date><risdate>2005</risdate><spage>176</spage><epage>191</epage><pages>176-191</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540272373</isbn><isbn>3540272372</isbn><eisbn>3540320350</eisbn><eisbn>9783540320357</eisbn><abstract>Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11513575_10</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Foundations of Genetic Algorithms, 2005, p.176-191 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17026662 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Coarse Graining Computer science control theory systems Equivalence Class Equivalence Relation Exact sciences and technology Genetic Algorithm Simple Genetic Algorithm Theoretical computing |
| title | Coarse Graining Selection and Mutation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T14%3A25%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Coarse%20Graining%20Selection%20and%20Mutation&rft.btitle=Foundations%20of%20Genetic%20Algorithms&rft.au=Rowe,%20Jonathan%20E.&rft.date=2005&rft.spage=176&rft.epage=191&rft.pages=176-191&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540272373&rft.isbn_list=3540272372&rft_id=info:doi/10.1007/11513575_10&rft_dat=%3Cpascalfrancis_sprin%3E17026662%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320350&rft.eisbn_list=9783540320357&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |