471 search results - page 7 / 95 » On the Relative Dominance of Paging Algorithms |
DM
2008
14 years 10 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
IPL
2008
14 years 9 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
CLEF
2010
Springer
14 years 11 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
113
click to vote
SIGMOD
1993
ACM
15 years 1 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
ICGA
1997
14 years 11 months ago
1997
A methodology is described for synthesizing signal processing networks, which are used to solve a low-cost medical signal processing problem. The approach makes use of genetic alg...