Sciweavers

868 search results - page 40 / 174
» Optimizing Logic Design Using Boolean Transforms
Sort
View
TCAD
1998
114views more  TCAD 1998»
14 years 9 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
GPCE
2009
Springer
15 years 2 months ago
A language and framework for invariant-driven transformations
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
Yanhong A. Liu, Michael Gorbovitski, Scott D. Stol...
DLOG
2001
14 years 11 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat
96
Voted
ENTCS
2006
162views more  ENTCS 2006»
14 years 9 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
15 years 4 months ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...