2124 search results - page 148 / 425 » Aggregating time partitions |
136
Voted
RTSS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
136
Voted
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
We present a new min-cut based placement algorithm for large scale sea-of-gates arrays. In the past all such algorithms used a xed cut line sequence that is determined before min...
126
click to vote
NETWORKING
2004
15 years 5 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
127
click to vote
TIT
2008
15 years 3 months ago
2008
We develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way...
119
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...