Sciweavers

1450 search results - page 171 / 290
» On the Complexity of Hardness Amplification
Sort
View
WSC
2007
13 years 11 months ago
Visualization techniques utilizing the sensitivity analysis of models
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
Ivo Kondapaneni, Pavel Kordík, Pavel Slav&i...
WSC
2008
13 years 11 months ago
Simulations-based and solver-based optimization approaches for batch processes in semiconductor manufacturing
Scheduling is one of the key factors for semiconductor fabrication productivity. Objectives like lot cycle time and throughput must be optimized to push the technological developm...
Andreas Klemmt, Sven Horn, Gerald Weigert, Thomas ...
ASPDAC
2005
ACM
102views Hardware» more  ASPDAC 2005»
13 years 11 months ago
A framework for automated and optimized ASIP implementation supporting multiple hardware description languages
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
Oliver Schliebusch, Anupam Chattopadhyay, David Ka...
ISSTA
2010
ACM
13 years 11 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
COCOA
2008
Springer
13 years 11 months ago
Parameterized Graph Editing with Chosen Vertex Degrees
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
Luke Mathieson, Stefan Szeider