Implementation and evaluation of genetic algorithms for system partitioning
The implementation and evaluation of several algorithms to solve the partitioning problem are described. Partitioning is performed according to the main strategy of, at each step, separating the elements into two groups and seeking to minimize the connections between elements belonging to different...
Gespeichert in:
| Veröffentlicht in: | International journal of electronics 1995-03, Vol.78 (3), p.435-447 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 447 |
|---|---|
| container_issue | 3 |
| container_start_page | 435 |
| container_title | International journal of electronics |
| container_volume | 78 |
| creator | CURATELLI, F. |
| description | The implementation and evaluation of several algorithms to solve the partitioning problem are described. Partitioning is performed according to the main strategy of, at each step, separating the elements into two groups and seeking to minimize the connections between elements belonging to different groups. Several algorithms arc considered; in particular, the main aim of this work is to evaluate algorithms and to consider the possibility of improving them by introducing steps based on the use of 'hill climbing' and simulated annealing algorithms. The numerical results of many computer simulations are presented to outline the main features of each algorithm and to give an evaluation of the most suitable way of solving the partitioning problem. |
| doi_str_mv | 10.1080/00207219508926175 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_infor</sourceid><recordid>TN_cdi_pascalfrancis_primary_3586158</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3586158</sourcerecordid><originalsourceid>FETCH-LOGICAL-c391t-4bfe977f6c0cebae413192c1e8baef8a474f205b4349db4832142688037f91933</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG85eK1OPtok4EUWPxYXvOi5pGmyRtIPkqjsv7dL1Yt4Gl7meWaYQeicwCUBCVcAFAQlqgSpaEVEeYAWhFW0YFDBIVrs-8UEiGN0ktIbALAK6AI9rrsx2M72WWc_9Fj3LbYfOrzPcXB4a3ubvcE6bIfo82uXsBsiTruUbYdHHbPfo77fnqIjp0OyZ991iV7ubp9XD8Xm6X69utkUhimSC944q4RwlQFjG205YURRQ6ycgpOaC-4olA1nXLUNl4wSTispgQmniGJsicg818QhpWhdPUbf6birCdT7b9R_vjE5F7Mz6mR0cFH3xqdfkZWyIqWcsOsZ8_10ZKc_hxjaOutdGOKPw_7f8gWb-nI5</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Implementation and evaluation of genetic algorithms for system partitioning</title><source>Taylor & Francis Journals Complete</source><creator>CURATELLI, F.</creator><creatorcontrib>CURATELLI, F.</creatorcontrib><description>The implementation and evaluation of several algorithms to solve the partitioning problem are described. Partitioning is performed according to the main strategy of, at each step, separating the elements into two groups and seeking to minimize the connections between elements belonging to different groups. Several algorithms arc considered; in particular, the main aim of this work is to evaluate algorithms and to consider the possibility of improving them by introducing steps based on the use of 'hill climbing' and simulated annealing algorithms. The numerical results of many computer simulations are presented to outline the main features of each algorithm and to give an evaluation of the most suitable way of solving the partitioning problem.</description><identifier>ISSN: 0020-7217</identifier><identifier>EISSN: 1362-3060</identifier><identifier>DOI: 10.1080/00207219508926175</identifier><language>eng</language><publisher>London: Taylor & Francis Group</publisher><subject>Applied sciences ; Design. Technologies. Operation analysis. Testing ; Electronics ; Exact sciences and technology ; Integrated circuits ; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</subject><ispartof>International journal of electronics, 1995-03, Vol.78 (3), p.435-447</ispartof><rights>Copyright Taylor & Francis Group, LLC 1995</rights><rights>1995 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c391t-4bfe977f6c0cebae413192c1e8baef8a474f205b4349db4832142688037f91933</citedby><cites>FETCH-LOGICAL-c391t-4bfe977f6c0cebae413192c1e8baef8a474f205b4349db4832142688037f91933</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207219508926175$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207219508926175$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,27922,27923,59645,60434</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3586158$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>CURATELLI, F.</creatorcontrib><title>Implementation and evaluation of genetic algorithms for system partitioning</title><title>International journal of electronics</title><description>The implementation and evaluation of several algorithms to solve the partitioning problem are described. Partitioning is performed according to the main strategy of, at each step, separating the elements into two groups and seeking to minimize the connections between elements belonging to different groups. Several algorithms arc considered; in particular, the main aim of this work is to evaluate algorithms and to consider the possibility of improving them by introducing steps based on the use of 'hill climbing' and simulated annealing algorithms. The numerical results of many computer simulations are presented to outline the main features of each algorithm and to give an evaluation of the most suitable way of solving the partitioning problem.</description><subject>Applied sciences</subject><subject>Design. Technologies. Operation analysis. Testing</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Integrated circuits</subject><subject>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</subject><issn>0020-7217</issn><issn>1362-3060</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LxDAQhoMouK7-AG85eK1OPtok4EUWPxYXvOi5pGmyRtIPkqjsv7dL1Yt4Gl7meWaYQeicwCUBCVcAFAQlqgSpaEVEeYAWhFW0YFDBIVrs-8UEiGN0ktIbALAK6AI9rrsx2M72WWc_9Fj3LbYfOrzPcXB4a3ubvcE6bIfo82uXsBsiTruUbYdHHbPfo77fnqIjp0OyZ991iV7ubp9XD8Xm6X69utkUhimSC944q4RwlQFjG205YURRQ6ycgpOaC-4olA1nXLUNl4wSTispgQmniGJsicg818QhpWhdPUbf6birCdT7b9R_vjE5F7Mz6mR0cFH3xqdfkZWyIqWcsOsZ8_10ZKc_hxjaOutdGOKPw_7f8gWb-nI5</recordid><startdate>19950301</startdate><enddate>19950301</enddate><creator>CURATELLI, F.</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19950301</creationdate><title>Implementation and evaluation of genetic algorithms for system partitioning</title><author>CURATELLI, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c391t-4bfe977f6c0cebae413192c1e8baef8a474f205b4349db4832142688037f91933</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Applied sciences</topic><topic>Design. Technologies. Operation analysis. Testing</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Integrated circuits</topic><topic>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CURATELLI, F.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>International journal of electronics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>CURATELLI, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Implementation and evaluation of genetic algorithms for system partitioning</atitle><jtitle>International journal of electronics</jtitle><date>1995-03-01</date><risdate>1995</risdate><volume>78</volume><issue>3</issue><spage>435</spage><epage>447</epage><pages>435-447</pages><issn>0020-7217</issn><eissn>1362-3060</eissn><abstract>The implementation and evaluation of several algorithms to solve the partitioning problem are described. Partitioning is performed according to the main strategy of, at each step, separating the elements into two groups and seeking to minimize the connections between elements belonging to different groups. Several algorithms arc considered; in particular, the main aim of this work is to evaluate algorithms and to consider the possibility of improving them by introducing steps based on the use of 'hill climbing' and simulated annealing algorithms. The numerical results of many computer simulations are presented to outline the main features of each algorithm and to give an evaluation of the most suitable way of solving the partitioning problem.</abstract><cop>London</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207219508926175</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7217 |
| ispartof | International journal of electronics, 1995-03, Vol.78 (3), p.435-447 |
| issn | 0020-7217 1362-3060 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_3586158 |
| source | Taylor & Francis Journals Complete |
| subjects | Applied sciences Design. Technologies. Operation analysis. Testing Electronics Exact sciences and technology Integrated circuits Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices |
| title | Implementation and evaluation of genetic algorithms for system partitioning |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T19%3A00%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Implementation%20and%20evaluation%20of%20genetic%20algorithms%20for%20system%20partitioning&rft.jtitle=International%20journal%20of%20electronics&rft.au=CURATELLI,%20F.&rft.date=1995-03-01&rft.volume=78&rft.issue=3&rft.spage=435&rft.epage=447&rft.pages=435-447&rft.issn=0020-7217&rft.eissn=1362-3060&rft_id=info:doi/10.1080/00207219508926175&rft_dat=%3Cpascalfrancis_infor%3E3586158%3C/pascalfrancis_infor%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 |