Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
David A. Cohen, Peter Jeavons, Christopher Jeffers...