Sciweavers

250 search results - page 2 / 50
» A Parallel Iterative Improvement Stable Matching Algorithm
Sort
View
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
13 years 10 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...
IPPS
2005
IEEE
13 years 10 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
ICALP
1991
Springer
13 years 8 months ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
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...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
13 years 8 months ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang
CCR
2006
122views more  CCR 2006»
13 years 4 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer