1 resultado para Global Optimization
em Greenwich Academic Literature Archive - UK
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (2)
- Aberystwyth University Repository - Reino Unido (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (5)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (6)
- Boston University Digital Common (1)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (9)
- CentAUR: Central Archive University of Reading - UK (8)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (22)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Deakin Research Online - Australia (34)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (12)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (27)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (236)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (4)
- National Center for Biotechnology Information - NCBI (3)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (14)
- Queensland University of Technology - ePrints Archive (468)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositorio Institucional de la Universidad de Málaga (3)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (27)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (9)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (17)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (4)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Montréal (1)
- Université de Montréal, Canada (2)
- University of Queensland eSpace - Australia (2)
Resumo:
The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.