60 search results - page 5 / 12 » Compact Representation of Sets of Binary Constraints |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
IVC
2008
13 years 7 months ago
2008
We consider the problem of extracting features for multi-class recognition problems. The features are required to make fine distinction between similar classes, combined with tole...
EURODAC
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
CPM
2010
Springer
14 years 12 days ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
AAAI
2007
13 years 10 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...