A Distributed constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, considering faster incomplete algorithms i...
详细信息
constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, static program analysis, test-case generation, scheduling, planning and graph problems. these ...
详细信息
A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are ...
详细信息
this paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU d...
详细信息
We present an extension to indexicals to describe propagators for global constraints. the resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show h...
详细信息
Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and ...
详细信息
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful...
详细信息
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structur...
详细信息
Bin packing is a ubiquitous problem that arises in many practical applications. the motivation for the work presented here comes from the domain of data centre optimisation. In this paper we present a parameterisable ...
详细信息
暂无评论