1254 search results - page 13 / 251 » Making Hard Problems Harder |
134
Voted
PODS
2007
ACM
16 years 17 days 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...
124
Voted
IJCAI
2001
15 years 1 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
102
Voted
STOC
2007
ACM
16 years 23 days ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
102
click to vote
LCTRTS
1995
Springer
15 years 4 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
140
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...