Sciweavers

2607 search results - page 483 / 522
» Complete Functional Synthesis
Sort
View
SIGMETRICS
2006
ACM
106views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
Automatic logging of operating system effects to guide application-level architecture simulation
Modern architecture research relies heavily on applicationlevel detailed pipeline simulation. A time consuming part of building a simulator is correctly emulating the operating sy...
Satish Narayanasamy, Cristiano Pereira, Harish Pat...
IEEEPACT
2005
IEEE
14 years 3 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
UIST
2005
ACM
14 years 3 months ago
Informal prototyping of continuous graphical interactions by demonstration
Informal prototyping tools have shown great potential in facilitating the early stage design of user interfaces. However, continuous interactions, an important constituent of high...
Yang Li, James A. Landay
CD
2005
Springer
14 years 3 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 3 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma