5171 search results - page 18 / 1035 » Deterministic Parallel Processing |
IPPS
1999
IEEE
14 years 5 days ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
IPPS
1998
IEEE
14 years 4 days ago
1998
IEEE
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
IPPS
1997
IEEE
14 years 2 days ago
1997
IEEE
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furni...
ADC
2004
Springer
14 years 1 months ago
2004
Springer
Lazy DFA (Deterministic Finite Automata) approach has been recently proposed to for efficient XML stream data processing. This paper discusses the drawbacks of the approach, sugge...
AMW
2010
13 years 9 months ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...