618 search results - page 8 / 124 » Short cycle connectivity |
TPDS
2010
13 years 5 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
IWCMC
2010
ACM
14 years 13 days ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
— The existence of short periodic orbits for the Lorenz system is studied rigorously. We describe a method for finding all short cycles embedded in a chaotic singular attractor ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
JGT
2008
13 years 7 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...