Sciweavers

17760 search results - page 350 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 8 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
ETRA
2010
ACM
213views Biometrics» more  ETRA 2010»
15 years 8 months ago
Qualitative and quantitative scoring and evaluation of the eye movement classification algorithms
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 8 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
GECCO
2008
Springer
154views Optimization» more  GECCO 2008»
15 years 8 months ago
Genetic algorithms for self-spreading nodes in MANETs
We present a force-based genetic algorithm for self-spreading mobile nodes uniformly over a geographical area. Wireless mobile nodes adjust their speed and direction using a genet...
Cem Safak Sahin, Elkin Urrea, M. Ümit Uyar, M...
CVIU
2008
180views more  CVIU 2008»
15 years 7 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...