3934 search results - page 559 / 787 » Approximate Schedulability Analysis |
162
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
149
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
146
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
181
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper addresses a parameter synthesis problem for nonlinear hybrid systems. Considering a set of uncertain parameters and a safety property, we give an algorithm tha...
190
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...