271 search results - page 15 / 55 » Equal To The Task |
FCT
2005
Springer
14 years 1 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
IMA
2003
Springer
14 years 23 days ago
2003
Springer
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
RTSS
1996
IEEE
13 years 11 months ago
1996
IEEE
Several Panwheel schedulers have been reported preuaously for schedulang real-tame systems an whach the temporal dastances between consecutave executaons of tasks must be less tha...
IJCAI
1989
13 years 8 months ago
1989
Is there one logical de nition of diagnosis? In this paper I argue that the answer to this question is \no". This paper is about the pragmatics of using logic for diagnosis w...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...