Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A mixed evolutionary-statistical analysis of an algorithm's complexity
Author: Cotta, C
Moscato, P
Abstract: A combination of evolutionary algorithms and statistical techniques is used to analyze the worst-case computational complexity of two sorting algorithms. It is shown that excellent bounds for these algorithms can be obtained using this approach; this fact raises interesting prospects for applying the approach to other problems and algorithms. Several guidelines for extending this work are included. (C) 2002 Elsevier Science Ltd. All rights reserved.
Subject: algorithms
statistical analysis
computational complexity
evolutionary computing
Country: Inglaterra
Editor: Pergamon-elsevier Science Ltd
Citation: Applied Mathematics Letters. Pergamon-elsevier Science Ltd, v. 16, n. 1, n. 41, n. 47, 2003.
Rights: fechado
Identifier DOI: 10.1016/S0893-9659(02)00142-8
Date Issue: 2003
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000179408900007.pdf372.25 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.