Sciweavers

613 search results - page 28 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
COGSCI
2010
234views more  COGSCI 2010»
13 years 7 months ago
High Regularities in Eye-Movement Patterns Reveal the Dynamics of the Visual Working Memory Allocation Mechanism
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
Xiaohui Kong, Christian D. Schunn, Garrick L. Wall...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 1 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
JUCS
2008
200views more  JUCS 2008»
13 years 7 months ago
Tabu Search on GPU
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
Adam Janiak, Wladyslaw A. Janiak, Maciej Lichtenst...
ISCI
2008
83views more  ISCI 2008»
13 years 7 months ago
A diversity maintaining population-based incremental learning algorithm
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
Mario Ventresca, Hamid R. Tizhoosh