134 search results - page 3 / 27 » Adaptive stable marriage algorithms |
JCO
2008
13 years 8 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present an application of stable marriages algorithms, applied to level-line junctions, for obstacle detection. The method is implemented on our PiCar stereovisi...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
ALGORITHMICA
2010
13 years 8 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
ICALP
1991
Springer
14 years 2 days ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...