Sökning: "combinatorial optimization"

Visar resultat 6 - 10 av 81 avhandlingar innehållade orden combinatorial optimization.

  1. 6. Variational Methods in Combinatorial Optimization and Phylogeny Reconstruction

    Författare :Henrik Jönsson; Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; statistical physics; gravitation; relativity; annealing; variational; mean-field; phylogeny; constraint satisfaction; combinatorial optimization; maximum likelihood; Physics; Fysik; Mathematical and general theoretical physics; quantum mechanics; classical mechanics; klassisk mekanik; kvantmekanik; relativitet; statistisk fysik; termodynamik; Fysicumarkivet A:2001:Jönsson; Matematisk och allmän teoretisk fysik; thermodynamics;

    Sammanfattning : Algorithms based on the variational approach, as used in statistical physics, are developed. For constraint satisfaction problems a novel cost function, based on information-theoretic arguments, is introduced, and an algorithm similar to the mean-field annealing algorithm is proposed. LÄS MER

  3. 7. Neural Network Ensembles and Combinatorial Optimization with Applications in Medicine

    Författare :Henrik Haraldsson; Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; machine learning; artificial neural networks; ensemble methods; feature extraction; ECG; combinatorial optimization; mean field annealing; Computer science; numerical analysis; systems; Datalogi; control; system; kontroll; Artificial intelligens; Artificiell intelligens; Fysicumarkivet A:2003:Haraldsson;

    Sammanfattning : Artificial neural network (ANN) and combinatorial optimization algorithms are developed, and applied to the medical domain. A novel method for training an ensemble of ANN is presented, based on random weight updates alternated with replication of networks with low error. LÄS MER

  4. 8. Decomposition Methods for Combinatorial Optimization

    Författare :Uledi Ngulo; Torbjörn Larsson; Nils-Hassan Quttineh; Egbert Mujuni; Athanasios Migdalas; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. LÄS MER

  5. 9. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Författare :Cenny Wenner; Johan Håstad; Viggo Kann; Irit Dinur; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; datalogi; Computer Science;

    Sammanfattning : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). LÄS MER

  7. 10. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER