Sciweavers

83 search results - page 8 / 17
» Bounding Loop Iterations for Timing Analysis
Sort
View
AUTOMATICA
2008
88views more  AUTOMATICA 2008»
14 years 11 months ago
Control design with guaranteed ultimate bound for perturbed systems
We present a new control design method for perturbed multiple-input systems, which guarantees any desired componentwise ultimate bound on the system state. The method involves eig...
Ernesto Kofman, María M. Seron, Hernan Haim...
RTAS
2008
IEEE
15 years 6 months ago
A Modular Worst-case Execution Time Analysis Tool for Java Processors
Recent technologies such as the Real-Time Specification for Java promise to bring Java’s advantages to real-time systems. While these technologies have made Java more predictab...
Trevor Harmon, Martin Schoeberl, Raimund Kirner, R...
SAS
1991
Springer
15 years 3 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
IPL
2008
146views more  IPL 2008»
14 years 11 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
CODES
2008
IEEE
15 years 6 months ago
Static analysis of processor stall cycle aggregation
Processor Idle Cycle Aggregation (PICA) is a promising approach for low power execution of processors, in which small memory stalls are aggregated to create a large one, and the p...
Jongeun Lee, Aviral Shrivastava