Sciweavers

867 search results - page 159 / 174
» Optimizing synthesis with metasketches
Sort
View
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
14 years 2 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
LICS
1997
IEEE
14 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
WCRE
1997
IEEE
14 years 1 months ago
Reverse Engineering is Reverse Forward Engineering
Reverse Engineering is focused on the challenging task of understanding legacy program code without having suitable documentation. Using a transformational forward engineering per...
Ira D. Baxter, Michael Mehlich
ICPR
2010
IEEE
14 years 24 days ago
Near-Regular BTF Texture Model
—In this paper we present a method for seamless enlargement and editing of intricate near-regular type of bidirectional texture function (BTF) which contains simultaneously both ...
Michael Haindl, Martin Hatka
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
14 years 11 days ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...