Sciweavers

2656 search results - page 66 / 532
» Design and analysis of algorithms reconsidered
Sort
View
198
Voted
FOGA
2011
14 years 8 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
CCE
2006
15 years 4 months ago
Sensitivity analysis of differential-algebraic equations and partial differential equations
Sensitivity analysis generates essential information for model development, design optimization, parameter estimation, optimal control, model reduction and experimental design. In...
Linda R. Petzold, Shengtai Li, Yang Cao, Radu Serb...
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
15 years 8 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
ASPDAC
2006
ACM
101views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Worst case execution time analysis for synthesized hardware
- We propose a hardware performance estimation flow for fast design space exploration, based on worst-case execution time analysis algorithms for software analysis. Test cases on s...
Jun-hee Yoo, Xingguang Feng, Kiyoung Choi, Eui-You...
157
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang