Name
Abstract | ||
|---|---|---|
In this paper, we propose "stable marriages" algorithms based on a novel representation called marriage table. After explaining how properties as global satisfaction, se x equality and stability show in the representation, we define 3 algorithms corresponding to 3 different scans of t he marriage table to meet progressively all constraints. The performance is evaluated in front of the population size for 200 instances in each case. That supports qualitative statistic analysis. Two matchin g examples in image processing are displayed for illustration. |
Year | Venue | Keywords |
|---|---|---|
2005 | ICINCO | stable marriages,matching algorithms.,stable marriage,statistical analysis,image processing,population size |
Field | DocType | Citations |
Statistic,Algorithm,Image processing,Population size,Mathematics | Conference | 4 |
PageRank | References | Authors |
0.55 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bertrand Zavidovique | 1 | 216 | 29.64 |
| Nikom Suvonvorn | 2 | 19 | 3.50 |
| Guna Seetharaman | 3 | 584 | 44.59 |