4164 search results - page 203 / 833 » Timing model reduction for hierarchical timing analysis |
180
click to vote
PADS
1999
ACM
15 years 11 months ago
1999
ACM
In an attempt to cope with time-varying workload, traditional adaptive Time Warp protocols are designed to react in response to performance changes by altering control parameter c...
165
click to vote
TCS
2008
15 years 6 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
164
click to vote
RTSS
2000
IEEE
15 years 11 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
140
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
145
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...