Sökning: "heuristic algorithms"

Visar resultat 1 - 5 av 75 avhandlingar innehållade orden heuristic algorithms.

  1. 1. Constructing Evolutionary Trees - Algorithms and Complexity

    Författare :Anna Östlin; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

  2. 2. Crowdsensing-driven Route Optimisation Algorithms for Smart Urban Mobility

    Författare :Petar Mrazovic; Mihhail Matskin; Anne Håkansson; Josep Luis Larriba-Pey; Roman Dumitru; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; smart cities; smart mobility; urban mobility; mobile crowdsensing; route journey planning; route optimisation; heuristic algorithms; smarta städer; smart rörlighet; rörlighetsavkänning; mobil publikmätning; ruttplanering; ruttoptimering; heuristiska algoritmer; Ciudades inteligentes; movilidad inteligente; mobile crowdsensing; planificación de viajes rutas; optimización de rutas; algoritmos heurísticos; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Urban mobility is often considered as one of the main facilitators for greener and more sustainable urban development. However, nowadays it requires a significant shift towards cleaner and more efficient urban transport which would support for increased social and economic concentration of resources in cities. LÄS MER

  3. 3. Algorithms and Systems for Virtual Machine Scheduling in Cloud Infrastructures

    Författare :Wubin Li; Erik Elmroth; Johan Tordsson; Guillaume Pierre; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; cloud computing; virtual machine; scheduling; systems; algorithms;

    Sammanfattning : With the emergence of cloud computing, computing resources (i.e., networks, servers, storage, applications, etc.) are provisioned as metered on-demand services over net- works, and can be rapidly allocated and released with minimal management effort. LÄS MER

  4. 4. Coverage Planning and Resource Allocation in Broadband Cellular Access : Optimization Models and Algorithms

    Författare :Lei Chen; Di Yuan; Thomas Stidsen; Linköpings universitet; []
    Nyckelord :TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : The last two decades have witnessed a booming in the use of cellular communication technologies. Billions of people are now enjoying the benefits of mobile communications. This thesis deals with planning and optimization of broadband cellular access network design and operation. LÄS MER

  5. 5. Accelerating Convergence of Large-scale Optimization Algorithms

    Författare :Euhanna Ghadimi; Mikael Johansson; Angelia Nedich; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Convex optimization; Large-scale systems; First-order methods; Convergence analysis; ADMM; Optimization algorithms; Electrical Engineering; Elektro- och systemteknik; Matematik; Mathematics;

    Sammanfattning : Several recent engineering applications in multi-agent systems, communication networks, and machine learning deal with decision problems that can be formulated as optimization problems. For many of these problems, new constraints limit the usefulness of traditional optimization algorithms. LÄS MER