3758 search results - page 117 / 752 » A Complete Subsumption Algorithm |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
CCR
2006
14 years 10 months ago
2006
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
WRLA
2010
14 years 8 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
108
click to vote
ISCAPDCS
2008
14 years 11 months ago
2008
We give a new distributed algorithm EasyMAC for the slot assignment for media access control (MAC) of nodes in a sensor network. Our algorithm reduces both the number of messages ...
MOC
1998
14 years 9 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...