Model-based applications in engineering, such as diagnosis,configuration or interactive decision-support systems, require embedded constraint solvers with challenging capabilities. Not only consistency checking and so...
详细信息
the time required for a backtracking search procedure to solve a problem can be minimized by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assu...
详细信息
We systematically investigate the connections between constraint satisfaction problems, structures of bounded tree width, and definability in logics with a finite number of variables. We first show that constraint sat...
详细信息
this paper develops a secure distributed constraint Satisfaction algorithm. A Distributed constraint Satisfaction Problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple agents. A m...
详细信息
this paper introduces a new filtering algorithm for handling systems of quadratic equations and inequations. Such constraints are widely used to model distance relations in numerous application areas ranging from robo...
详细信息
Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. this paper presents ...
详细信息
GSAT has been proven highly effective for solving certain classes of large SAT problems. It starts from a randomly generated truth assignment and tries to reduce the number of violated clauses by iteratively flipping ...
详细信息
the proceedings contain 84 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Hybrid benders decomposition algorithms in constraint logic programm...
ISBN:
(纸本)3540428631
the proceedings contain 84 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Hybrid benders decomposition algorithms in constraint logic programming;a hybrid framework integrating mixed integer programming and constraint logic programming;towards stochastic constraintprogramming;global cut framework for removing symmetries;capturing structure with satisfiability;phase transitions and backbones of 3-sat and maximum 3-sat;solving non-binary CSPS using the hidden variable encoding;a filtering algorithm for the stretch constraint;network flow problems in constraintprogramming;pruning for the minimum constraint family and for the number of distinct values constraint family;components for state restoration in tree search;constraint-based verification of client-server protocols;lower bounds for non-binary constraint optimization problems;a general scheme for multiple lower bound computation in constraint optimization;solving disjunctive constraints for interactive graphical applications;non-overlapping constraints between convex polytopes;formal models of heavy-tailed behavior in combinatorial search;in search of a phase transition in the ac-matching problem;a CLP approach to the protein side-chain placement problem;solving constraints over floating-point numbers;optimal pruning in parametric differential equations;an efficient filtering technique combining domain partition and arc consistency;the expressive power of binary linear programming;the traveling tournament problem description and benchmarks;structural constraint-based modeling and reasoning with basic configuration cells;solving Boolean satisfiability using local search guided by unit clause elimination and fast optimal instruction scheduling for single-issue processors with arbitrary latencies.
暂无评论