1 resultado para Plant genetic engineering
em Dalarna University College Electronic Archive
Filtro por publicador
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- Applied Math and Science Education Repository - Washington - USA (3)
- Aquatic Commons (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (3)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (1)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca de Teses e Dissertações da USP (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) (10)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (24)
- Brock University, Canada (5)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (10)
- CentAUR: Central Archive University of Reading - UK (45)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (57)
- Cochin University of Science & Technology (CUSAT), India (6)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (25)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (11)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (44)
- Greenwich Academic Literature Archive - UK (3)
- Helda - Digital Repository of University of Helsinki (6)
- Indian Institute of Science - Bangalore - Índia (47)
- Infoteca EMBRAPA (1)
- Instituto Gulbenkian de Ciência (1)
- Instituto Politécnico do Porto, Portugal (3)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (25)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (62)
- Queensland University of Technology - ePrints Archive (239)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (46)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (9)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (9)
- Université de Lausanne, Switzerland (8)
- Université de Montréal (2)
- Université de Montréal, Canada (8)
- University of Connecticut - USA (1)
- University of Michigan (11)
- University of Queensland eSpace - Australia (191)
Resumo:
Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones.