Log in

Relevant bibliographies by topics / Mutation operators / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Mutation operators.

Dissertations / Theses on the topic 'Mutation operators'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 19 dissertations / theses for your research on the topic 'Mutation operators.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Korejo, Imtiaz Ali. "Adaptive mutation operators for evolutionary algorithms." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/10315.

Full text

Abstract:

Evolutionary algorithms (EAs) are a class of stochastic search and optimization algorithms that are inspired by principles of natural and biological evolution. Although EAs have been found to be extremely useful in finding solutions to practically intractable problems, they suffer from issues like premature convergence, getting stuck to local optima, and poor stability. Recently, researchers have been considering adaptive EAs to address the aforementioned problems. The core of adaptive EAs is to automatically adjust genetic operators and relevant parameters in order to speed up the convergence

APA, Harvard, Vancouver, ISO, and other styles

2

Andersson, Michael. "An Experimental Evaluation of PIT’s Mutation Operators." Thesis, Umeå universitet, Institutionen för datavetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-142506.

Full text

Abstract:

Mutation testing is a fault-finding software testing technique that creates mutants by injecting a syntactic change into the source code. This technique operates by evaluating the ability of a testsuite to detect mutants, which is used to asses the quality of a test suite. The information from mutation testing can be used to improve the quality of a test suite by developing additional test cases. It is a promising technique, but the expensive nature of mutation testing has prevented its wide spread, practical use. One approach to make mutation testing more efficient is selective mutation testi

APA, Harvard, Vancouver, ISO, and other styles

3

McCormick, II Donald W. "Towards A Sufficient Set of Mutation Operators for Structured Query Language (SQL)." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/32526.

Full text

Abstract:

Test suites for database applications depend on adequate test data and real-world test faults for success. An automated tool is available that quantifies test data coverage for database queries written in SQL. An automated tool is also available that mimics real-world faults by mutating SQL, however tests have revealed that these simulated faults do not completely represent real-world faults. This paper demonstrates how half of the mutation operators used by the SQL mutation tool in real-world test suites generated significantly lower detection scores than those from research test suites. Thre

APA, Harvard, Vancouver, ISO, and other styles

4

Wongsavengwate, Pisamai. "Adaptive dispatching using genetic algorithms for multiple resources." Ohio : Ohio University, 1997. http://www.ohiolink.edu/etd/view.cgi?ohiou1184598551.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bryant, Kylie. "Genetic Algorithms and the Travelling Salesman Problem." Scholarship @ Claremont, 2000. https://scholarship.claremont.edu/hmc_theses/126.

Full text

Abstract:

Genetic algorithms are an evolutionary technique that use crossover and mutation operators to solve optimization problems using a survival of the fittest idea. They have been used successfully in a variety of different problems, including the traveling salesman problem. In the traveling salesman problem we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. The traveling salesman problem is NP-hard but has many real world applications so a good solution would be useful. Many different crossover and mutation operators have been devised for the traveling s

APA, Harvard, Vancouver, ISO, and other styles

6

Hong, Libin. "Hyper-heuristic approaches to automatically designing heuristics as mutation operators for evolutionary programming on function classes." Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/52348/.

Full text

Abstract:

A hyper-heuristic is a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Researchers classify hyper-heuristics according to the source of feedback during learning: Online learning hyper-heuristics learn while solving a given instance of a problem; Offline learning hyper-heuristics learn from a set of training instances, a method that can generalise to unseen instances. Genetic programming (GP) can be considered a specialization of the more widely known genetic algorithms (GAs) where each individual is a computer program. GP autom

APA, Harvard, Vancouver, ISO, and other styles

7

Veruete, Mario. "Étude d'équations de réplication-mutation non locales en dynamique évolutive." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS012/document.

Full text

Abstract:

Nous analysons trois modèles non-locaux décrivant la dynamique évolutive d’un trait phénotypique continu soumis à l’action conjointe des mutations et de la sélection. Nous établissons l’existence et l’unicité des solutions du problème de Cauchy, et donnons la description du comportement en temps long de la solution. Dans le premier travail nous étudions l’équation du réplicateur-mutateur en domaine non borné et généralisons aux cas des valeurs sélectives confinantes les résultats connus dans le cas harmonique. À savoir, l’existence d’une unique solution globale, régulière, convergeant en temps

APA, Harvard, Vancouver, ISO, and other styles

8

Maciel, Ana Claudia. "Avaliação da qualidade de oráculos de teste utilizando mutação." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-24072017-142852/.

Full text

Abstract:

No desenvolvimento de software, a qualidade do produto está diretamente relacionada à qualidade do processo de desenvolvimento. Diante disso, atividades de Verificação, Validação & Teste (VV&T) realizadas por meio de métodos, técnicas e ferramentas são de extrema necessidade para o aumento da produtividade, qualidade e diminuição de custos no desenvolvimento de software. Do mesmo modo, técnicas e critérios contribuem para a produtividade das atividades de teste. Um ponto crucial para o teste de software é sua automatização, tornando as atividades mais confiáveis e diminuindo significativamente

APA, Harvard, Vancouver, ISO, and other styles

9

Snášelová, Petra. "Analýza genetických algoritmů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236206.

Full text

Abstract:

This thesis deals with analysis of genetic algorithms. It is focused on various approaches to creation of new populations. A comparison between basic principles of operation of genetic algorithms and processes occurring in living organisms is drawn here. Some methods of application of particular steps of genetic algorithms are introduced and a suitability of the methods to certain types of problems is considered. The main goal in the thesis is to apply genetic algorithms in solving three types of optimization problems, namely the solution of functions with a single major extreme, functions wit

APA, Harvard, Vancouver, ISO, and other styles

10

Barbosa, Ellen Francine. "Uma contribuição para determinação de um conjunto essencial de operadores de mutação no teste de programas C." Universidade de São Paulo, 1998. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05022001-165802/.

Full text

Abstract:

Estudos empíricos têm mostrado que a Análise de Mutantes um dos critérios de teste baseado em erros é bastante eficaz em revelar a presença de erros. Entretanto, seu alto custo, decorrente principalmente do grande número de mutantes gerados, tem motivado a proposição de diversas abordagens alternativas para a sua aplicação. Um estudo relevante nesse sentido resultou na determinação de um conjunto essencial de operadores de mutação para a linguagem Fortran, mostrando-se que é possível reduzir o custo de aplicação do critério, preservando um alto grau de adequação em relação à Análise de Mut

APA, Harvard, Vancouver, ISO, and other styles

11

Gupta, Pranshu. "Enhancing evaluation techniques using Mutation Operator Production Rule System and accidental fault methodology." Diss., Kansas State University, 2014. http://hdl.handle.net/2097/17636.

Full text

Abstract:

Doctor of Philosophy<br>Department of Computing and Information Sciences<br>David A. Gustafson<br>Software testing is an essential component of software development life cycle, and certain software testing methodologies require enormous amounts of time and expense in order to detect and correct errors in a software system. The two primary goals of any testing methodology are error detection and increased reliability. Each methodology utilizes a unique technique to achieve these goals and detect faults in the software. In this paper, an evaluation approach is presented that can enhance evaluati

APA, Harvard, Vancouver, ISO, and other styles

12

Keller, Katja, Cornelia Meisel, Nannette Grübling, Andrea Petzold, Pauline Wimberger, and Karin Kast. "Patient-Reported Satisfaction after Prophylactic Operations of the Breast." Karger, 2019. https://tud.qucosa.de/id/qucosa%3A71425.

Full text

Abstract:

Background: Prophylactic mastectomies in carriers of mutations in BRCA1 or BRCA2 are becoming increasingly more accepted. We investigated the outcome after prophylactic mastectomy, especially regarding satisfaction with the procedure, in a monocenter study. Methods: BRCA1/2 mutation carriers and non-carriers with elevated pedigree-based cancer risk were followed prospectively in a structured surveillance program between 2000 and 2017. A retrospective telephone survey was conducted among all patients with documented prophylactic mastectomy. Complications and satisfaction with the decision for

APA, Harvard, Vancouver, ISO, and other styles

13

Simaitis, Rokas. "Iteratyviosios tabu paieškos algoritmo komivojažieriaus uždaviniui tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060602_173228-37727.

Full text

Abstract:

In this work, the iterated tabu search (ITS) algorithm for the traveling salesman problem (TSP) is discussed. The TSP is a well-known combinatorial optimization problem. Thus, solving the TSP means searching for the shortest closed tour in which every city is visited exactly once. Various heuristic algorithms can be used for solving the TSP, among them, tour construction heuristics, simulated annealing, genetic algorithms, etc. One of the promising heuristic techniques is the iterated tabu search approach. ITS consists of two main parts: standard tabu search (TS) and mutation of solutions. The

APA, Harvard, Vancouver, ISO, and other styles

14

Márki, András. "On Software Testing and Subsuming Mutants : An empirical study." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10595.

Full text

Abstract:

Mutation testing is a powerful, but resource intense technique for asserting software quality. This report investigates two claims about one of the mutation operators on procedural logic, the relation operator replacement (ROR). The constrained ROR mutant operator is a type of constrained mutation, which targets to lower the number of mutants as a “do smarter” approach, making mutation testing more suitable for industrial use. The findings in the report shows that the hypothesis on subsumption is rejected if mutants are to be detected on function return values. The second hypothesis stating th

APA, Harvard, Vancouver, ISO, and other styles

15

Onder, Ilter. "A Genetic Algorithm For Tsp With Backhauls Based On Conventional Heuristics." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608726/index.pdf.

Full text

Abstract:

A genetic algorithm using conventional heuristics as operators is considered in this study for the traveling salesman problem with backhauls (TSPB). Properties of a crossover operator (Nearest Neighbor Crossover, NNX) based on the nearest neighbor heuristic and the idea of using more than two parents are investigated in a series of experiments. Different parent selection and replacement strategies and generation of multiple children are tried as well. Conventional improvement heuristics are also used as mutation operators. It has been observed that 2-edge exchange and node insertion heuristics

APA, Harvard, Vancouver, ISO, and other styles

16

Silva, Pedro Miguel Oliveira Carvalho da. "Automated Generic Optimization in Real time using Mutation Operators." Master's thesis, 2021. https://hdl.handle.net/10216/135938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Silva, Pedro Miguel Oliveira Carvalho da. "Automated Generic Optimization in Real time using Mutation Operators." Dissertação, 2021. https://hdl.handle.net/10216/135938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Tsai, Chi-Hung, and 蔡其杭. "Protein Side-chain Prediction by using Family Competition Evolutionary Approach with Rotamer Mutation Operator." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/37661453843264988881.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊工程學研究所<br>89<br>The problem to be solved here is to predict protein side-chain conformations with fixed main-chain. There are two key points for predicting the structure of side-chain: the first point is how to explore the conformational space; the other point is how to distinguish between native structures from non-native ones. We propose an approach to predict protein side-chain conformation, by applying the Family Competition Evolutionary Approach developed by Dr. J. M. Yang. In the evolutionary stage，we integrate self-adaptive Gaussian mutation and decreasing-based Gaussi

APA, Harvard, Vancouver, ISO, and other styles

19

Pennington, Catherine Aileen. "Mutations in the catB operator-promoter region allow alternative regualtion of the benA promoter in Acinetobacter baylyi strain ADP1." 2009. http://purl.galileo.usg.edu/uga%5Fetd/pennington%5Fcatherine%5Fa%5F200905%5Fms.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!