Sökning: "Repair algorithms"

Visar resultat 1 - 5 av 17 uppsatser innehållade orden Repair algorithms.

  1. 1. Evaluation of performance of MSI detection tools using targeted sequencing data

    Master-uppsats, Uppsala universitet/Institutionen för biologisk grundutbildning

    Författare :Satya Krishna Prasanna Kolluri; [2021]
    Nyckelord :MSI; MSIcallers; Insilico dilutions; subsampling;

    Sammanfattning : In recent years, digitalization and computer-based technologies have greatly revolutionized the field of bioinformatics. Advance research and development of computer-based programs have enhanced various DNA sequencing technologies. LÄS MER

  3. 2. Using Data-Driven Feasible Region Approximations to Handle Nonlinear Constraints When Applying CMA-ES to the Initial Margin Optimization Problem

    Master-uppsats, KTH/Matematisk statistik

    Författare :Karl Wallström; [2021]
    Nyckelord :Optimization; Initial margin; Evolutionary algorithms; CMA-ES; Support vector machines; Boundary constraint handling; Nonlinear constraints; Repair algorithms; Feasible region approximation; Optimering; Initial margin; Evolutionära algoritmer; CMA-ES; Support vector machines; Hantering av bivillkor; Icke-linjära bivillkor; Reparationsalgoritmer; Approximation av tillåtet område;

    Sammanfattning : The introduction of initial margin requirements for non-cleared OTC derivatives has made it possible to optimize initial margin when considering a network of trading participants. Applying CMA-ES, this thesis has explored a new method to handle the nonlinear constraints present in the initial margin optimization problem. LÄS MER

  4. 3. Using Hash Trees for Database Schema Inconsistency Detection

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Charlotta Spik; [2019]
    Nyckelord :Merkle Tree; Hash Tree; inconsistency detection; Anti-Entropy Repair; replica synchronization; Merkle träd; Hashträd; detektion av inkonsekvenser; Anti-Entropi Reparation; Synkronisering av replikor;

    Sammanfattning : For this work, two algorithms have been developed to improve the performance of the inconsistency detection by using Merkle trees. The first builds a hash tree from a database schema version, and the second compares two hash trees to find where changes have occurred. LÄS MER

  5. 4. Efficiency of Different Encoding Schemes in Swarm Intelligence for Solving Discrete Assignment Problems: A Comparative Study

    Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Författare :Richard Pettersson; [2019]
    Nyckelord :;

    Sammanfattning : Background Solving problems classified as either NP-complete or NP-hard has long been an active topic in the research community, and has brought about many new algorithms for approximating an optimal solution (basically the best possible solution). A fundamental aspect to consider when developing such an algorithm is how to represent the given solution. LÄS MER

  7. 5. Temporal Task and Motion Plans: Planning and Plan Repair : Repairing Temporal Task and Motion Plans Using Replanning with Temporal Macro Operators

    Master-uppsats, Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Författare :Erik Hansson; [2018]
    Nyckelord :Task planning; motion planning; temporal task planning; automatic planning; macro operator; temporal macro operator; artificial intelligence; temporal fast downward; context-enhanced additive heuristic;

    Sammanfattning : This thesis presents an extension to the Temporal Fast Downward planning system that integrates motion planning in it and algorithms for generating two types of temporal macro operators expressible in PDDL2.1. LÄS MER