1486 search results - page 164 / 298 » Algorithms for two-box covering |
132
click to vote
JCIT
2008
15 years 4 months ago
2008
There are various web caching replacement algorithms related to reference characteristics of web objects were researched. They could be used in regard to user characteristics of c...
107
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into...
127
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
137
click to vote
MASCOTS
2010
15 years 5 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
148
click to vote
DAM
2010
15 years 4 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...