971 search results - page 160 / 195 » Approximate Satisfiability and Equivalence |
COMBINATORICS
1999
14 years 11 months ago
1999
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
SAC
2002
ACM
14 years 11 months ago
2002
ACM
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
106
click to vote
RSA
2008
14 years 11 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
FOCM
2010
14 years 10 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
100
click to vote
HEURISTICS
2008
14 years 10 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...