Sciweavers

3758 search results - page 117 / 752
» A Complete Subsumption Algorithm
Sort
View
119
Voted
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 8 months ago
Average-Case Analyses of Vickrey Costs
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...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
CCR
2006
82views more  CCR 2006»
15 years 2 months ago
Why flow-completion time is the right metric for congestion control
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...
Nandita Dukkipati, Nick McKeown
110
Voted
WRLA
2010
15 years 17 days ago
Folding Variant Narrowing and Optimal Variant Termination
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...
Santiago Escobar, Ralf Sasse, José Meseguer
148
Voted
ISCAPDCS
2008
15 years 3 months ago
EasyMAC: A New and Simple Protocol for Slot Assignment
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 ...
Jerrolyn Brees, Sukhamay Kundu
70
Voted
MOC
1998
73views more  MOC 1998»
15 years 1 months ago
Detecting perfect powers in essentially linear time
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 ...
Daniel J. Bernstein