Sciweavers

28888 search results - page 189 / 5778
» Computability and complexity in analysis
Sort
View
TCAD
2010
168views more  TCAD 2010»
13 years 3 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
ESORICS
2011
Springer
12 years 8 months ago
Automated Information Flow Analysis of Virtualized Infrastructures
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
Sören Bleikertz, Thomas Groß, Matthias ...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 2 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
NSDI
2008
13 years 10 months ago
NetComplex: A Complexity Metric for Networked System Designs
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
Byung-Gon Chun, Sylvia Ratnasamy, Eddie Kohler
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 9 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...