NDLTD logo NDLTD Union Catalog and Global ETD Search

Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Constraint Programming (CP)"”.

  1. Heuristically guided constraint satisfaction for AI planning

    Judge, MarkUniversity of Strathclyde2015

    … using alternative techniques. One such paradigm, Constraint Programming (CP), has successfully been used in various planner architectures in recent years. The efficacy of a given constraint reformulation depends on the encoding method, search technique(s) employed, and the consequent amount of …

    strathclyde Repository record

  2. Constraint programming for optimization under uncertainty in inventory control

    Rossi, RobertoUniversity College Cork2008

    Constraint Programming (CP) is a programming paradigm where relations between variables can be stated in the form of constraints. CP features discrete domains and global constraints. Global constraints capture interesting substructures of a problem, encapsulate dedicated inference algorithms based …

    cork Repository record

  3. Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems

    Booth, Kyle Ewart Coventry2021

    … The central thesis of this dissertation is that constraint programming (CP) can be an effective and flexible paradigm for modeling and solving routing problems involving electric vehicles. While efforts on the development of mixed-integer linear programming (MILP) approaches to electric vehicle …

    toronto-retro Repository record

  4. Hybrid Solving Techniques for Project Scheduling Problems

    Schulz, Jens2013

    … Lösungstechniken entwickelt haben. Constraint Integer Programming ist ein hybrides Branch-and-Bound-Verfahren, das Techniken aus dem Constraint Programming (CP), Integer Programming (IP) und von SAT-Lösern eng miteinander verknüpft. Es ermöglicht die Anwendung dieser Techniken in …

    tu-berlin Repository record

  5. Partial compilation of constraint problems

    Balogh, AndreaUniversity College Cork2024

    Constraint Programming (CP) is a powerful paradigm for solving combinatorial problems, but due to a large search space, solving can be very time consuming. Diagnosis, planning, product configuration are example use-cases [XBZ+ 21]. These problems are often used in an online setting, where a user …

    cork Repository record