Sciweavers

4865 search results - page 684 / 973
» The Complexity of Graph Connectivity
Sort
View
IPPS
1996
IEEE
15 years 9 months ago
A Parallel Algorithm for Minimization of Finite Automata
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
Bala Ravikumar, X. Xiong
235
Voted
HPDC
1993
IEEE
15 years 9 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington
FDL
2007
IEEE
15 years 8 months ago
Transactor-based Formal Verification of Real-time Embedded Systems
With the increasing complexity of today's embedded systems, there is a need to formally verify such designs at mixed abstraction levels. This is needed if some compoe describ...
Daniel Karlsson, Petru Eles, Zebo Peng
124
Voted
ACRI
2006
Springer
15 years 8 months ago
Merging Cellular Automata for Simulating Surface Effects
This paper describes a model of three-dimensional cellular automata allowing to simulate different phenomena in the fields of computer graphics or image processing. Our method allo...
Stéphane Gobron, Denis Finck, Philippe Even...
ARCS
2006
Springer
15 years 8 months ago
Constraint-Based Deployment of Distributed Components in a Dynamic Network
Hierarchical software components offer interesting characteristics for the development of complex applications. However, supporting the deployment of such applications is difficult...
Didier Hoareau, Yves Mahéo