Sciweavers

861 search results - page 40 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
DAC
2008
ACM
16 years 2 months ago
Cache modeling in probabilistic execution time analysis
Multimedia-dominated consumer electronics devices (such as cellular phone, digital camera, etc.) operate under soft real-time constraints. Overly pessimistic worst-case execution ...
Yun Liang, Tulika Mitra
WORDS
2003
IEEE
15 years 6 months ago
Event-Driven Support of Real-Time Sentient Objects
The emergence of applications operating independently of direct human control is inevitable. Research on high-level models for this class of applications— e.g. on autonomous age...
Paulo Veríssimo, Antonio Casimiro
WCET
2008
15 years 2 months ago
Towards an Automatic Parametric WCET Analysis
Static WCET analysis obtains a safe estimation of the WCET of a program. The timing behaviour of a program depends in many cases on input, and an analysis could take advantage of ...
Stefan Bygde, Björn Lisper
CASES
2009
ACM
14 years 11 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
AAIP
2009
15 years 2 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson