2612 search results - page 31 / 523 » Switching Graphs and Their Complexity |
VLSID
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper presents the applicability of a cosimulation methodology based on an object-oriented simulation environment, to multi-domain and multi-language systems design. This met...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
SIROCCO
1997
13 years 11 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
JAIR
2008
13 years 9 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
RSA
2000
13 years 9 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...