323 search results - page 43 / 65 » Dualizability and graph algebras |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
ENTCS
2010
13 years 7 months ago
2010
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
ICNP
2007
IEEE
14 years 2 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
ICCAD
1996
IEEE
13 years 12 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...