Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...