3934 search results - page 189 / 787 » Approximate Schedulability Analysis |
157
click to vote
ECRTS
2003
IEEE
15 years 11 months ago
2003
IEEE
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
184
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
194
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
155
click to vote
TALG
2010
15 years 4 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
272
click to vote
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...