14379 search results - page 2738 / 2876 » is 2000 |
132
click to vote
AI
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
127
click to vote
ALT
2000
Springer
15 years 9 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
156
click to vote
ANTS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
193
click to vote
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
147
Voted
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...