Sciweavers

971 search results - page 160 / 195
» Approximate Satisfiability and Equivalence
Sort
View
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
15 years 6 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
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 (...
Sergei Evdokimov, Ilia N. Ponomarenko
SAC
2002
ACM
15 years 6 months ago
Location adjustment for the minimum volume ellipsoid estimator
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
Christophe Croux, Gentiane Haesbroeck, Peter J. Ro...
RSA
2008
103views more  RSA 2008»
15 years 5 months ago
What is the furthest graph from a hereditary property?
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...
Noga Alon, Uri Stav
FOCM
2010
108views more  FOCM 2010»
15 years 4 months ago
Parallelization Method for a Continuous Property
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...
Pawel Pilarczyk
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 4 months ago
Enhancing set constraint solvers with lexicographic bounds
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...
Andrew Sadler, Carmen Gervet