Sciweavers

7311 search results - page 13 / 1463
» Time in State Machines
Sort
View
ARVLSI
1995
IEEE
179views VLSI» more  ARVLSI 1995»
13 years 10 months ago
Algorithms for the optimal state assignment of asynchronous state machines
This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen ca...
Robert M. Fuhrer, Bill Lin, Steven M. Nowick
UIST
2006
ACM
14 years 20 days ago
SwingStates: adding state machines to the swing toolkit
This article describes SwingStates, a library that adds state machines to the Java Swing user interface toolkit. Unlike traditional approaches, which use callbacks or listeners to...
Caroline Appert, Michel Beaudouin-Lafon
ORL
2002
71views more  ORL 2002»
13 years 6 months ago
A push-pull queueing system
We consider a two node multiclass queueing network given by two machines each with two classes. There are two streams of jobs: One stream originates in machine 1, which feeds it f...
Anat Kopzon, Gideon Weiss
HIPC
2004
Springer
14 years 3 days ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri
DAC
1996
ACM
13 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga