3458 search results - page 293 / 692 » Abstracting Control |
183
click to vote
RTSS
2003
IEEE
15 years 12 months ago
2003
IEEE
We address the problem of providing compositional hard real-time guarantees in a hierarchy of schedulers. We first propose a resource model to characterize a periodic resource al...
182
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
182
click to vote
VLSID
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—Microfluidics-based biochips are revolutionizing highthroughput sequencing, parallel immunoassays, clinical diagnostics, and drug discovery. These devices enable the pre...
156
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
164
click to vote
USENIX
2007
15 years 9 months ago
2007
Tame is a new event-based system for managing concurrency in network applications. Code written with Tame abstractions does not suffer from the “stackripping” problem associat...