970 search results - page 96 / 194 » Adaptive Analysis of On-line Algorithms |
134
click to vote
JSCIC
2008
15 years 4 months ago
2008
In this article we discuss recent work on coarse-graining methods for microscopic stochastic lattice systems. We emphasize the numerical analysis of the schemes, focusing on error ...
163
click to vote
ECRTS
2005
IEEE
15 years 9 months ago
2005
IEEE
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
144
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
172
click to vote
SIGMOD
1993
ACM
15 years 8 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...
139
click to vote
DKE
2008
15 years 4 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...