58 search results - page 7 / 12 » Lexicographic Path Induction |
115
Voted
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
103
Voted
DM
2007
15 years 1 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
73
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
This paper provides a new, decidable definition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for...
118
Voted
USITS
2003
15 years 3 months ago
2003
: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peer-to-peer systems. In practice, two disadv...
100
click to vote
AAAI
1990
15 years 3 months ago
1990
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...