Sökning: "instance"

Visar resultat 1 - 5 av 1414 avhandlingar innehållade ordet instance.

  1. 1. Moderate Nominalism and Moderate Realism

    Författare :Christer Svennerlind; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Nyckelord :HUMANIORA; HUMANITIES; analytic ontology; moderate nominalism; moderate realism; particular; universal; abstract; concrete; abstract particular; abstract universal; concrete particular; concrete universal; trope; moment; complex unity; collection; instance; unit attribute; intensional aspect; predicational aspect; continuous composite; articulated composite;

    Sammanfattning : The subject matter of this thesis is analytic ontology. Chapters II and III deal with two versions of trope theory, or moderate nominalism; these are defined as ontologies which recognise properties and relations but no (real) universals. The key notion of both theories, trope, is characterised as an abstract particular. LÄS MER

  2. 2. Automatic Instance-based Tailoring of Parameter Settings for Metaheuristics

    Författare :Felix Dobslaw; Theo Kanter; Åke Malmberg; Thomas Bartz-Beielstein; Mittuniversitetet; []
    Nyckelord :Algorithm Configuration; Parameter Tuning; Parameter Control; Metaheuristics;

    Sammanfattning : Many industrial problems in various fields, such as logistics, process management, orproduct design, can be formalized and expressed as optimization problems in order tomake them solvable by optimization algorithms. However, solvers that guarantee thefinding of optimal solutions (complete) can in practice be unacceptably slow. LÄS MER

  3. 3. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

    Författare :Thatchaphol Saranurak; Danupon Nanongkai; Piotr Sankowski; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer Science;

    Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER

  4. 4. Object Instance Detection and Dynamics Modeling in a Long-Term Mobile Robot Context

    Författare :Nils Bore; John Folkesson; Joydeep Biswas; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; robotics; long-term; mapping; tracking; unsupervised learning; estimation; object modeling; Datalogi; Computer Science;

    Sammanfattning : In the last years, simple service robots such as autonomous vacuum cleaners and lawn mowers have become commercially available and increasingly common. The next generation of service robots should perform more advanced tasks, such as to clean up objects. LÄS MER

  5. 5. A default extension to description logics and its applications

    Författare :Niclas Wahllöf; Linköpings universitet; []
    Nyckelord :HUMANITIES; HUMANIORA; HUMANIORA; HUMANITIES;

    Sammanfattning : This thesis discusses how to extend a family of knowledge representation formalisms known as description logics with default rules. Description logics are tailored to express knowledge in problem domains of a hierarchical or taxonomical nature, that is domains where the knowledge is easily expressed in terms of concepts, objects and relations. LÄS MER