3934 search results - page 365 / 787 » Approximate Schedulability Analysis |
163
click to vote
EMSOFT
2004
Springer
16 years 4 days ago
2004
Springer
We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each...
186
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
141
click to vote
JSSPP
1997
Springer
15 years 11 months ago
1997
Springer
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
179
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
177
click to vote
ICMCS
2010
IEEE
15 years 7 months ago
2010
IEEE
In many scenarios, such as TV/radio advertising production, animation production, and presentation, music pieces are constrained in the metric of time. For example, an editor want...