We investigate the composition of representative benchmark sets for evaluating and improving the performance of robust Boolean constraint solvers in the context of satisfiability testing and answer set programming. St...
详细信息
the Traveling Tournament Problem with Predefined Venues (TTPPV) has been introduced as an abstraction of sports scheduling. Exact integer programming and heuristic approaches have been proposed so far. We investigate ...
详细信息
the proceedings contain 59 papers. the topics discussed include: orchestrating satisfiability engines;operations research and constraintprogramming at Google;a constraint seeker: finding and ranking global constraint...
ISBN:
(纸本)9783642237850
the proceedings contain 59 papers. the topics discussed include: orchestrating satisfiability engines;operations research and constraintprogramming at Google;a constraint seeker: finding and ranking global constraints from examples;bin repacking scheduling in virtualized datacenters;optimal carpet cutting;a hybrid approach for solving real-world nurse rostering problems;constraintprogramming for controller synthesis;neuron constraints to model complex real-world problems;an efficient light solver for querying the semantic web;on guaranteeing polynomially bounded search tree size;a framework for decision-based consistencies;tractable triangles;on minimal weighted clones;filtering algorithms for discrete cumulative problems with overloads of resource;revisiting the tree constraint;half reification and flattening;the parameterized complexity of local consistency;and symmetry breaking in numeric constraint problems.
the proceedings contain 61 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Neuron constraints to model complex real-world problems;A constraint...
ISBN:
(纸本)9783642237850
the proceedings contain 61 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Neuron constraints to model complex real-world problems;A constraint based approach to cyclic RCPSP;an efficient light solver for querying the semantic web;on guaranteeing polynomially bounded search tree size;a framework for decision-based consistencies;Hierarchically nested convex VCSP;tractable triangles;on minimal weighted clones;Solving MAXSAT by solving a sequence of simpler SAT instances;operations research and constraintprogramming at google;filtering algorithms for discrete cumulative problems with overloads of resource;Synthesis of search algorithms from high-level CP models;revisiting the tree constraint;half reification and flattening;the parameterized complexity of local consistency;symmetry breaking in numeric constraint problems;on minimal constraint networks;structural tractability of constraint optimization;models and strategies for variants of the job shop scheduling problem;MaxRPC algorithms based on bitwise operations;Solving problems with CP: Four common pitfalls to avoid;Grid-based SAT solving with iterative partitioning and clause learning;large neighborhood search for dial-a-ride problems;On deciding MUS membership with QBF;On the relative efficiency of DPLL and OBDDs with axiom and join;Min CSP on four elements: Moving beyond submodularity;algorithm selection and scheduling;incorporating variance in impact-based search;a quadratic edge-finding filtering algorithm for cumulative resource constraints;A CSP solver focusing on FAC variables;constraint reasoning and kernel clustering for pattern decomposition with scaling;a constraint seeker: Finding and ranking global constraints from examples;solving qualitative constraints involving landmarks;search combinators.
this paper presents a constraintprogramming approach to solve a specific scheduling problem arising in a company specialized in drug evaluation and pharmacology research. the aim is to build employee timetables cover...
详细信息
constraintprogramming has become an important technology for solving hard combinatorial problems in a diverse range of application domains. It has its roots in artificial intelligence, mathematical programming, opera...
详细信息
In 2004, Jean-Francois Puget presented [2] an analysis of the "simplicity of Use" of constraintprogramming from which he articulated a series of challenges to make constraintprogramming systems accessible ...
详细信息
Lazy Clause Generation is a powerful approach to reducing search in constraintprogramming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called no...
详细信息
the proceedings contain 20 papers. the topics discussed include: Quarantine: a framework to mitigate memory errors in JNI applications;portable and accurate collection of calling-context-sensitive byte-code metrics fo...
ISBN:
(纸本)9781450309356
the proceedings contain 20 papers. the topics discussed include: Quarantine: a framework to mitigate memory errors in JNI applications;portable and accurate collection of calling-context-sensitive byte-code metrics for the Java virtual machine;the Java virtual machine in retargetable, high-performance instruction set simulation;a DSL for writing type systems for Xtext languages, space-based multi-core programming in Java;Habanero-Java: the new adventures of old X10;ejIP: a TCP/IP stack for embedded Java;the soul tool suite for querying programs in symbiosis with Eclipse;Jazz2: a flexible and extensible framework for structural testing;object reuse and behavior adaptation in Java-like languages;trace-based compilation for the Java hotspot virtual machine;tool demonstration: overseer - low-level hardware monitoring and management for java;and optimized memory management for class metadata in a JVM.
the number of finite semigroups increases rapidly withthe number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be...
详细信息
暂无评论