10608 search results - page 626 / 2122 » Complexity of O'Hara's Algorithm |
171
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
184
click to vote
CN
2008
15 years 7 months ago
2008
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
211
click to vote
PE
2008
Springer
15 years 7 months ago
2008
Springer
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
170
click to vote
SWAT
2004
Springer
16 years 17 days ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
175
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...