the Single-Row Facility Layout Problem is an NP-hard problem dealing withthe ordering of departments with given lengths and pairwise traffic intensities in a facility. In this context, one seeks to minimize the sum o...
详细信息
Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the do- mains of shared variabl...
详细信息
Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome the problem is to employ sophisticated models with no or at least...
详细信息
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make dec...
详细信息
In automated negotiation, one of crucial problems is how a negotiating agent evaluates the acceptability of an offer. Most models mainly use two kinds of evaluation methods: (i) linear utility functions that depend on...
详细信息
ISBN:
(纸本)9783319448329;9783319448312
In automated negotiation, one of crucial problems is how a negotiating agent evaluates the acceptability of an offer. Most models mainly use two kinds of evaluation methods: (i) linear utility functions that depend on issues, and (ii) nonlinear utility functions that depend on crisp constraints. However, in real life, it is hard for human users to input so much and so accurate information that these evaluation methods require. To this end, this paper proposes a new approach for offer evaluation where human users are allowed to input indeterminate information. More specifically, we propose a framework of prioritised intuitionistic fuzzy constraint satisfaction problems for modelling agent's goals. Moreover, we take both satisfaction degree and dissatisfaction degree into consideration when calculating an agent's acceptability of an offer. Finally, we discuss how to make trade-offs via similarity measure based on intuitionistic fuzzy criteria functions.
Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally ...
详细信息
the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this tech...
详细信息
Structural decomposition methods have been proposed for identifying tractable constraint Satisfaction Problems (CSPs) [1-5]. the basic principle is to decompose a CSP into tree-structured sub-problems. the subproblems...
详细信息
this paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem. Consistency of the constra...
详细信息
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortunately, disjunctions are typically no...
详细信息
暂无评论