3934 search results - page 213 / 787 » Approximate Schedulability Analysis |
161
click to vote
ALGOSENSORS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
220
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
186
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
182
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, a design method for automotive architectures is proposed. The two main technical contributions are (i) a novel hardware/software architecture encoding that unifies ...
191
click to vote
ECRTS
2006
IEEE
16 years 17 days ago
2006
IEEE
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...