562 search results - page 8 / 113 » Dependency Pairs Revisited |
ANTS
2004
Springer
14 years 24 days ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
KES
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we present a method for finding general dependencies between individual agents in a multi-agent system. We use mutual information as the general measure for dependen...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
CADE
2001
Springer
13 years 12 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...