Sökning: "constraint-based local search"

Hittade 2 avhandlingar innehållade orden constraint-based local search.

  1. 1. Set Constraints for Local Search

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Magnus Ågren; Uppsala universitet.; Uppsala universitet.; SICS.; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap; Datavetenskap; Computer Science; Computer science; combinatorial problems; constraint-based local search; constraint-directed search; constraint programming; incremental algorithms; monadic existential second-order logic; neighbourhoods; penalty; set variables; set constraints; variable conflicts;

    Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER

  2. 2. High-level modelling and local search

    Detta är en avhandling från Uppsala University

    Författare :Magnus Ågren; Uppsala universitet.; Uppsala universitet.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Sammanfattning : Combinatorial optimisation problems are ubiquitous in our society and appear in such varied guises as DNA sequencing, scheduling, configuration, airline-crew and nurse rostering, combinatorial auctions, vehicle routing, and financial portfolio design. Their efficient solution is crucial to many people and has been the target for much research during the last decades. LÄS MER