Sciweavers

5372 search results - page 138 / 1075
» complexity 2007
Sort
View
EMSOFT
2007
Springer
14 years 2 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
EWC
2007
60views more  EWC 2007»
13 years 7 months ago
A simulation-based design paradigm for complex cast components
This paper describes and exercises a new design paradigm for cast components. The methodology integrates foundry process simulation, non-destructive evaluation (nde), stress analys...
Stéphane P. A. Bordas, James G. Conley, Bri...
IJAC
2007
116views more  IJAC 2007»
13 years 7 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
CSL
2007
Springer
14 years 2 months ago
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
Yijia Chen, Jörg Flum
MCU
2007
95views Hardware» more  MCU 2007»
13 years 9 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud