Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/340
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Guo, Q | - |
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Harman, M | - |
dc.contributor.author | Derderian, K | - |
dc.coverage.spatial | 14 | en |
dc.date.accessioned | 2006-11-03T15:28:46Z | - |
dc.date.available | 2006-11-03T15:28:46Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | IEE Proceedings - Software 152 (3): 127-140, Jun 2005 | en |
dc.identifier.uri | http://www.iee.org/Publish/Journals/ProfJourn/Proc/SEN/index.cfm | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/340 | - |
dc.description.abstract | Multiple unique input/output sequences (UIOs) are often used to generate robust and compact test sequences in finite state machine (FSM) based testing. However, computing UIOs is NP-hard. Metaheuristic optimisation techniques (MOTs) such as genetic algorithms (GAs) and simulated annealing (SA) are effective in providing good solutions for some NP-hard problems. In the paper, the authors investigate the construction of UIOs by using MOTs. They define a fitness function to guide the search for potential UIOs and use sharing techniques to encourage MOTs to locate UIOs that are calculated as local optima in a search domain. They also compare the performance of GA and SA for UIO construction. Experimental results suggest that, after using a sharing technique, both GA and SA can find a majority of UIOs from the models under test. | en |
dc.format.extent | 1162982 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Institution of Engineering and Technology | en |
dc.subject | Heuristic method | en |
dc.subject | NP hard problem | en |
dc.subject | Genetic algorithm | en |
dc.subject | Simulated annealing | en |
dc.subject | Optimization method | en |
dc.title | Constructing multiple unique input/output sequences using metaheuristic optimisation techniques | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1049/ip-sen:20045001 | - |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Constructing Metaheuristic 2005.pdf | 1.14 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.