1279 search results - page 33 / 256 » Fast Implementations of Automata Computations |
ICDCS
2002
IEEE
14 years 17 days ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
TALG
2008
13 years 7 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
TJS
2002
13 years 7 months ago
2002
Abstract-The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the ...
SIPS
2006
IEEE
14 years 1 months ago
2006
IEEE
: Molecular electronics is commonly conceived as reproducing diode or transistor action at the molecular level. The quantum-dot cellular automata (QCA) approach offers an attractiv...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...