Sciweavers

4342 search results - page 243 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
TPDS
2002
80views more  TPDS 2002»
15 years 5 months ago
Performance Optimization Problem in Speculative Prefetching
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...
ICIP
2003
IEEE
16 years 7 months ago
Sequential Monte Carlo video text segmentation
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...
Datong Chen, Jean-Marc Odobez
EVOW
2009
Springer
15 years 3 months ago
An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems
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...
Lili Liu, Dingwei Wang, Shengxiang Yang
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
15 years 5 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
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-...
Susanne Albers, Michael Mitzenmacher
GECCO
2003
Springer
15 years 10 months ago
Problem-Independent Schema Synthesis for Genetic Algorithms
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
Yong-Hyuk Kim, Yung-Keun Kwon, Byung Ro Moon