Sciweavers

3678 search results - page 19 / 736
» On the Stable Paths Problem
Sort
View
BMVC
2002
14 years 7 days ago
Robust Wide Baseline Stereo from Maximally Stable Extremal Regions
The wide-baseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements...
Jiri Matas, Ondrej Chum, Martin Urban, Tomá...
EVOW
2001
Springer
14 years 2 months ago
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem
This contribution investigates the usefulness of F. Glover’s path tracing concept within a Genetic Algorithm context for the solution of the multiconstrained knapsack problem (MK...
Jens Levenhagen, Andreas Bortfeldt, Hermann Gehrin...
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
14 years 4 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
HIPC
2003
Springer
14 years 3 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
COMCOM
1999
87views more  COMCOM 1999»
13 years 9 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang