1 resultado para Quadratic Number Field
em Dalarna University College Electronic Archive
Filtro por publicador
- Aberdeen University (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- Aquatic Commons (7)
- 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 (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (16)
- Boston University Digital Common (3)
- Brock University, Canada (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (6)
- CaltechTHESIS (8)
- Cambridge University Engineering Department Publications Database (14)
- CentAUR: Central Archive University of Reading - UK (36)
- Center for Jewish History Digital Collections (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (28)
- Cochin University of Science & Technology (CUSAT), India (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (20)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (1)
- Digital Commons at Florida International University (1)
- DigitalCommons - The University of Maine Research (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (5)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (7)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (4)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (68)
- Institutional Repository of Leibniz University Hannover (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (50)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (32)
- Queensland University of Technology - ePrints Archive (483)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (49)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (9)
- Universidade Complutense de Madrid (5)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (11)
- Université de Montréal, Canada (2)
- University of Connecticut - USA (1)
- University of Michigan (12)
- University of Queensland eSpace - Australia (8)
- University of Washington (3)
- WestminsterResearch - UK (1)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
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.