9 search results - page 2 / 2 » Almost Stable Matchings by Truncating the Gale-Shapley Algor... |
CTRSA
2007
Springer
13 years 9 months ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
ASPDAC
1999
ACM
13 years 9 months ago
1999
ACM
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange ”chemicals” with their neighbors during the gr...