1063 search results - page 133 / 213 » Order and Negation as Failure |
97
Voted
CONCUR
1998
Springer
15 years 5 months ago
1998
Springer
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
109
Voted
VLDB
1998
ACM
15 years 5 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
223
Voted
ICNP
1996
IEEE
15 years 5 months ago
1996
IEEE
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...
121
click to vote
LPKR
1997
Springer
15 years 5 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
113
Voted
ECAI
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...