3934 search results - page 175 / 787 » Approximate Schedulability Analysis |
159
click to vote
RTCSA
2007
IEEE
16 years 21 days ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
220
click to vote
JAT
2008
15 years 6 months ago
2008
Variable Hilbert scales are an important tool for the recent analysis of inverse problems in Hilbert spaces, as these constitute a way to describe smoothness of objects other than ...
182
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
155
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
170
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...