1972 search results - page 113 / 395 » connection 2008 |
124
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
245
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
166
click to vote
CN
2006
15 years 6 months ago
2006
In this paper, we study the benefits of advertising wavelength availability in a distributed lightpath establishment environment by extensive simulations. Various cases with diffe...
133
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
IEICET
2008
15 years 5 months ago
2008
Stackable ROADMs (S-ROADMs) have been proposed for use in regional IP-over-CWDM networks. The S-ROADM can be constructed by connecting modules with different wavelengths required i...