the proceedings contain 54 papers. the topics discussed include: a constraintprogramming approach for allocation and scheduling on the CELL broadband engine;planning and scheduling the operation of a very large oil p...
ISBN:
(纸本)3540859578
the proceedings contain 54 papers. the topics discussed include: a constraintprogramming approach for allocation and scheduling on the CELL broadband engine;planning and scheduling the operation of a very large oil pipeline network;search strategies for rectangle packing;solving a telecommunications feature subscription configuration problem;protein structure prediction with large neighborhood constraintprogramming search;an application of constraintprogramming to superblock instruction scheduling;classes of submodular constraints expressible by graph cuts;optimization of simple tabular reduction of table constraints;cost-based domain filtering for stochastic constraintprogramming;dichotomic search protocols for constrained optimization;a framework for hybrid tractability results in Boolean weighted constraint satisfaction problems;and from high girth graphs to hard instances.
the proceedings contain 14 papers. the topics discussed include: configuration of heterogeneous agent fleet: a preliminary generic model;challenges in automotive hardware-software co-configuration;prospective and retr...
the proceedings contain 14 papers. the topics discussed include: configuration of heterogeneous agent fleet: a preliminary generic model;challenges in automotive hardware-software co-configuration;prospective and retrospective approaches to integrate life cycle assessment in configurators: a multiple case study in the construction industry;premises, challenges and suggestions for modelling building knowledge using the configuration paradigm;requirements and architectures for green configuration;developing an algorithm selector for green configuration in scheduling problems;instance configuration for sustainable job shop scheduling;product visualization in configurators: laying the foundations for a comparative description;and using answer set programming for assigning tasks to computing nodes.
constraintprogramming often involves global constraints, for which various custom filtering algorithms have been published. this work Presents a semi-automatic generation of CHR solvers for the subset of global const...
详细信息
ISBN:
(纸本)9783540859574
constraintprogramming often involves global constraints, for which various custom filtering algorithms have been published. this work Presents a semi-automatic generation of CHR solvers for the subset of global constraints defineable by specific automata. the generation is hissed on a constraint logic program modelling an automaton and an improved version of the Prim-Miner algorithm. the solvers only need to be generated once and achieve are-consistency for over 40 global constraints.
We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition phenomena, and identify classes of ha...
详细信息
ISBN:
(纸本)9783540859574
We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition phenomena, and identify classes of hard problems. Phase transition is shown to occur when varying problem parameters, such as the dictionary size and the number of blocked cells on a grid, of large-size realistic problems.
Recently proposed impact based heuristics have been shown to outperform other instances of tire first-fail policy such as the common dons and dom/deg heuristics. this paper compares the behaviour of a constraint and a...
详细信息
ISBN:
(纸本)9783540859574
Recently proposed impact based heuristics have been shown to outperform other instances of tire first-fail policy such as the common dons and dom/deg heuristics. this paper compares the behaviour of a constraint and a. variable centered impact based heuristic and relates it to the amount of constraint propagation inherent to the model of the problem. Additionally, it presents results which suggest that: a lookahead impact heuristic we recently proposed might be the best choice for problems with low locality and where constraint propagation plays an important role.
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constrai...
详细信息
ISBN:
(纸本)9783540859574
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? constraint variants are ubiquitous: implementing them requires considerable effort but yields better performance. this paper shows how to use variable views to derive perfect propagator variants: derived propagators inherit essential properties such as correctness and domain and bounds completeness.
constraints that are defined by tables of allowed tuples of assignments are common in constraintprogramming. In this paper we present an approach to reformulating table constraints of large arity into a conjunction o...
详细信息
ISBN:
(纸本)9783540859574
constraints that are defined by tables of allowed tuples of assignments are common in constraintprogramming. In this paper we present an approach to reformulating table constraints of large arity into a conjunction of lower arity constraints. Our approach exploits functional dependencies. We Study the complexity of finding reformulations that either minimize the memory size or arity of a constraint using a Set of its functional dependencies. We also present an algorithm to compute such reformulations. We Show that our technique is complementary to existing approaches for compressing extensional constraints.
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampling/Importance Resampling (SIR) compon...
详细信息
ISBN:
(纸本)9783540859574
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampling/Importance Resampling (SIR) component of our previous scheme of SampleSearch-SIR by taking advantage of the decomposition implied by the network's AND/OR search space. We also describe how our new scheme can approximately count and lower bound the number of solutions of a constraint network. We demonstrate boththeoretically and empirically that our new algorithm yields far better performance than competing approaches.
Solutions to valid Quantified constraint Satisfaction Problems (QCSPs) are called winning strategies and represent possible ways in which the existential player can react to the moves of the universal one to "win...
详细信息
ISBN:
(纸本)9783540859574
Solutions to valid Quantified constraint Satisfaction Problems (QCSPs) are called winning strategies and represent possible ways in which the existential player can react to the moves of the universal one to "win the game". However, different winning strategies are not necessarily equivalent: some may be preferred to others. We define Quantified constraint Optimization Problems (QCOP) as a framework which allows both to formally express preferences over QCSP strategies, and to solve the related optimization problem. We present examples and some experimental results. We also discuss flow this framework relates to other formalisms for hierarchical decision modeling known as von Stackelberg games and bilevel (and multilevel) programming.
暂无评论