Sciweavers

488 search results - page 49 / 98
» Automorphic Decompositions of Graphs
Sort
View
CSCLP
2004
Springer
14 years 1 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
ASYNC
1998
IEEE
110views Hardware» more  ASYNC 1998»
13 years 12 months ago
Analyzing Specifications for Delay-Insensitive Circuits
We present the XDI Model for specifying delay-insensitive circuits, that is, reactive systems that correctly exchange signals with their environment in spite of unknown delays inc...
Tom Verhoeff
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
13 years 7 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
JCT
2006
79views more  JCT 2006»
13 years 7 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
The Parallel-Sequential Duality : Matrices and Graphs
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
Serge Burckel