2373 search results - page 380 / 475 » On the Theory of Structural Subtyping |
161
click to vote
PODS
2000
ACM
15 years 10 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
193
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
190
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
171
click to vote
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
170
click to vote
WADT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...