85 search results - page 11 / 17 » State-transition machines, revisited |
WECWIS
2003
IEEE
14 years 27 days ago
2003
IEEE
Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguiti...
ASPDAC
2000
ACM
14 years 6 hour ago
2000
ACM
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
DATE
1998
IEEE
13 years 12 months ago
1998
IEEE
We extend the subsequence removal technique to provide signi cantly higher static compaction for sequential circuits. We show that state relaxation techniques can be used to ident...
CICLING
2004
Springer
13 years 11 months ago
2004
Springer
Domain shift is a challenging issue in dialogue management. This paper shows how to extract domain knowledge for dialogue model adaptation. The basic semantic concepts are derived ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Space is a spatial programming language designed to exploit the massive parallelism available in a formal model of computation called the Synchronic A-Ram, and physically related ...