Sciweavers

1068 search results - page 107 / 214
» For completeness, sublogarithmic space is no space
Sort
View
ICCD
1992
IEEE
126views Hardware» more  ICCD 1992»
14 years 28 days ago
High-Level State Machine Specification and Synthesis
Current synthesis methodologies based on hardwaredescription languages focus mainly on two distinct levels: behavior and register-transfer levels. In many practical cases, however...
Andreas Kuehlmann, Reinaldo A. Bergamaschi
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
14 years 26 days ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko
ARC
2007
Springer
140views Hardware» more  ARC 2007»
14 years 26 days ago
Reconfigurable Computing for Accelerating Protein Folding Simulations
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
Nilton B. Armstrong, Heitor S. Lopes, Carlos R. Er...
IAT
2007
IEEE
14 years 22 days ago
A Unified Framework Based on HTN and POP Approaches for Multi-Agent Planning
The purpose of this paper is to introduce a multi-agent model for plan synthesis in which the production of a global shared plan is based on a promising unified framework based on...
Damien Pellier, Humbert Fiorino
FATES
2004
Springer
14 years 17 days ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse