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 4 of 4 for “"Constraint programing"”.

  1. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT

    … using three modeling languages from AI: Constraint Programing (CP), Boolean Satisfiability (SAT), and Maximum Satisfiability (MAX-SAT). We then use solvers to find optimal solutions to this problem. We show which of these solvers is more efficient when finding optimal solutions. For this …

    denver Repository record for Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT (opens in a new tab)

  2. An efficient and portable implementation of a concurrent constraint language

    … a sequential implementation of a concurrent constraint programing language called Janus. The language implemented is somewhat different from the original Janus; it is a flat guarded language with assignment, similar to Strand and to FGHC. This implementation, called jc (Janus Compiler) …

    arizona-thes Repository record for An efficient and portable implementation of a concurrent constraint language (opens in a new tab)

  3. From Pattern Databases to Plan Libraries: Utilising Memory-based Methods for Improving AI Planning Performance

    … patterns into better heuristics, from using Constraint Programing languages (Minizinc) for finding optimal combinations, to sub-optimal but fast approaches using bin-packing algorithms for this. In continuation, we found novel ways of creating competitive patterns, by combining a full …

    kings Repository record for From Pattern Databases to Plan Libraries: Utilising Memory-based Methods for Improving AI Planning Performance (opens in a new tab) Download PDF for From Pattern Databases to Plan Libraries: Utilising Memory-based Methods for Improving AI Planning Performance (opens in a new tab)

  4. The Continuous Time Service Network Design Problem

    The service network design problem (SNDP) addresses the planning of operations for freight transportation carriers. Given a set of requests to transport commodities from specific origins to specific destinations, SNDP determines a continuous movement of vehicles to service demand. Demand becomes …

    waterloo Repository record for The Continuous Time Service Network Design Problem (opens in a new tab)