436 search results - page 16 / 88 » Decomposing constraint systems: equivalences and computation... |
CONSTRAINTS
2011
13 years 4 days ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
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 ...
ISORC
2009
IEEE
14 years 3 months ago
2009
IEEE
While the demand for high-integrity applications continues to rise, industrial developers seek cost effective development strategies that are capable of delivering the required gu...
CONCUR
1995
Springer
14 years 4 days ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...