An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad "...
Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Nin...
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...