Sciweavers

2467 search results - page 224 / 494
» Finite State Machines
Sort
View
DAC
1994
ACM
15 years 10 months ago
Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
Chi-Ying Tsui, Massoud Pedram, Alvin M. Despain
CORR
2011
Springer
189views Education» more  CORR 2011»
15 years 1 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
COMPGEOM
1996
ACM
15 years 10 months ago
Linear Complexity Hexahedral Mesh Generation
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
David Eppstein
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 10 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
BPM
2007
Springer
152views Business» more  BPM 2007»
16 years 26 days ago
Towards Dynamic Matching of Business-Level Protocols in Adaptive Service Compositions
In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service compo...
Alan W. Colman, Linh Duy Pham, Jun Han, Jean-Guy S...