Sciweavers

2 search results - page 1 / 1
» A short proof of optimality for the MIN cache replacement al...
Sort
View
IPL
2007
71views more  IPL 2007»
13 years 5 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy
TEC
2002
103views more  TEC 2002»
13 years 4 months ago
A short convergence proof for a class of ant colony optimization algorithms
In this paper, we prove some convergence properties for a class of ant colony optimization algorithms. In particular, we prove that for any small constant 0 and for a sufficiently ...
Thomas Stützle, Marco Dorigo