Sciweavers

466 search results - page 85 / 94
» A Worst Case Timing Analysis Technique for Optimized Program...
Sort
View
CASES
2006
ACM
14 years 2 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
TCBB
2010
104views more  TCBB 2010»
13 years 6 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 8 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
DAC
2008
ACM
14 years 9 months ago
Energy-optimal software partitioning in heterogeneous multiprocessor embedded systems
Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applicat...
Michel Goraczko, Jie Liu, Dimitrios Lymberopoulos,...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...