2313 search results - page 405 / 463 » On Heuristic Time Hierarchies |
167
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
154
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
In most cases safety stock is determined based on the variability of the demand and lead time. The focus has been on the statistics and past performance, and the existing framewor...
198
click to vote
MSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Caching techniques have been used to improve the performance gap of storage hierarchies in computing systems. In data intensive applications that access large data files over wid...
178
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
159
click to vote
ISLPED
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we investigate methods for improving the hit rates in the first level of memory hierarchy. Particularly, we propose victim cache structures to reduce the number of ...