作者：
Dubois, OlivierDequen, GillesLIP6
CNRS-Université Paris 6 4 place Jussieu Paris cedex 0575252 France LaRIA
Université de Picardie Jules Verne CURI 5 Rue du moulin neuf Amiens80000 France
To denote a (3,1,2)-conjugate orthogonal idempotent latin square of order n, the usual acronym is (3,1,2)-COILS(n). Up to now, existence of a (3,1,2)-COILS(n) had been proved for every positive integer n except n = 2,...
详细信息
Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of lower bounds to all singleton tuples, since it p...
详细信息
Distributed and collaborative agents are promising to play an important role in largescale multi-agent applications where such collaborative agents may enter into conflicts over their shared resources. Negotiation via...
ISBN:
(纸本)3540428631
Distributed and collaborative agents are promising to play an important role in largescale multi-agent applications where such collaborative agents may enter into conflicts over their shared resources. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is a promising approach to collaborative conflict resolution[1]. While previous implemented argumentation systems have performed well in small-size applications, no systematic investigation in large scale has been done. thus, several questions about computational performance of argumentation remain unaddressed; such as understanding if (and when) argumentation actually speeds up conflict resolution convergence and formulating different collaborative NVA strategies to understand their impact on convergence. Answering these questions requires an abstract, well-understood computational model of argumentation, suitable for large-scale experimental investigations.
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such...
详细信息
In this paper, we propose a general technique for removing symmetries in CSPs during search. the idea is to record no-goods, during the exploration of the search tree, whose symmetric counterpart (if any) should be re...
详细信息
the proceedings contain 47 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: constraints for interactive graphical applications;automatic generat...
ISBN:
(纸本)3540410538
the proceedings contain 47 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: constraints for interactive graphical applications;automatic generation of propagation rules for finite domains;global constraints as graph properties on a structured network of elementary constraints of the same type;universally quantified interval constraints;constraint propagation for soft constraints;constraints, inference channels and secure databases;a simple method for identifying tractable disjunctive constraints;a language for audiovisual template specification and recognition;new tractable classes from old;expressiveness of full first order constraints in the algebra of finite or infinite trees;cutting planes in constraintprogramming;a constraint-based framework for prototyping distributed virtual applications;a scalable linear constraint solver for user interface construction;maintaining arc-consistency within dynamic backtracking;analysis of random noise and random walk algorithms for satisfiability testing;faster algorithms for bound-consistency of the sortedness and the all different constraint;a hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences;linear formulation of constraintprogramming models and hybrid solvers;a global constraint combining a sum constraint and difference constraints;optimal anytime constrained simulated annealing for constrained global optimization;using randomization and learning to solve hard real-world instances of satisfiability;branching constraint satisfaction problems for solutions robust under likely changes and the phase transition in distributed constraint satisfaction problems.
作者：
Refalo, PhilippeILOG
Les Taissounieres 1681 route des Dolines Sophia Antipolis06560 France
constraintprogramming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization problems. We propose a way to provide...
详细信息
We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined s...
详细信息
constraint propagation [10,7,5] (CP) is a cornerstone algorithm of constraintprogramming, mainly devoted to the computation of local consistency properties of constraint satisfaction problems. the abstract formulatio...
ISBN:
(纸本)3540410538
constraint propagation [10,7,5] (CP) is a cornerstone algorithm of constraintprogramming, mainly devoted to the computation of local consistency properties of constraint satisfaction problems. the abstract formulation of CP is the combination of a set of reduction functions (black-box solvers) on a domain [8,9,2,1]. Intuitively, there is a dependence relation between functions and domains, such that a function must be applied if a domain it depends on is reduced. the essential property of CP is confluence or strategy-independence. In other words, the order solvers are applied does not influence the output characterized in terms of a common fixed-point of the solvers. Owing to this remark, several strategies based on heuristics, data structures, or knowledge of the solvers have been implemented.
the constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in an active environment. the agent and t...
详细信息
暂无评论