Sciweavers

16666 search results - page 293 / 3334
» Descriptive and Computational Complexity
Sort
View
DAC
2007
ACM
16 years 7 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
16 years 1 months ago
Design flow for embedded FPGAs based on a flexible architecture template
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many appl...
B. Neumann, Thorsten von Sydow, Holger Blume, Tobi...
HPDC
2008
IEEE
16 years 1 months ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
EMSOFT
2006
Springer
15 years 10 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing
178
Voted
BMCBI
2006
133views more  BMCBI 2006»
15 years 6 months ago
Web-based analysis of the mouse transcriptome using Genevestigator
Background: Gene function analysis often requires a complex and laborious sequence of laboratory and computer-based experiments. Choosing an effective experimental design generall...
Oliver Laule, Matthias Hirsch-Hoffmann, Tomas Hruz...