Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Stable marriage"”.
-
Stable Marriage Problem Based Adaptation for Clone Detection and Service Selection
… research, a well-known mathematical algorithm Stable Marriage Problem (SMP) and its variations are investigated to fulfil the purposes of matching processes in software engineering area. We aim to provide a competitive matching algorithm that can help to detect cloned software accurately and …
-
An approach to robustness in stable marriage and stable roommates problems
… matching problems. Our robustness notion for the stable matching framework is motivated by the unforeseen events that may occur after a matching is computed. We define the notion of (a,b)-supermatches as a measure of robustness of a matching. An (a,b)-supermatch characterizes a stable matching …
-
Efficient algorithms for bipartite matching problems with preferences
… problem (HR), a generalisation of the classical Stable Marriage problem. For each of these problems, we obtain a characterisation of Pareto optimal matchings, and then use this to obtain a polynomial-time algorithm for finding a maximum Pareto optimal matching. The next optimality criterion that …
-
Sufficient conditions for the existence of specified subgraphs in graphs
… of finding a matching in a graph. The stable marriage problem was introduced by Gale and Shapley in 1962 and the generalization to multiple dimensions was first mentioned by Knuth in 1976. We consider a generalization of the Stable Marriage problem with s-dimensions and purely cyclic …
-
The later orchestral works of William Walton: a critical and analytical re-evaluation
… far niente' of an isolated Italian island and a stable marriage - are suggestive of a broad shift in the composer's social and cultural values with consequent changes in musical attitudes and compositional tendencies. Walton's later music is differentiated from the pre-war works by the presence …
-
A specialised constraint approach for stable matching problems
… to be represented and solved relatively easily. Stable matching problems consist of a set of participants wishing to be matched into pairs or groups in a stable manner. A matching is said to be stable if there is no pair or group of participants that would rather make a private arrangement to …
-
Algorithmic aspects of stable matching problems
The Stable Marriage problem (SM), the Hospitals/Residents problem (HR) and the Stable Roommates problem (SR) are three classical stable matching problems that were first studied by Gale and Shapley in 1962. These problems have widespread practical application in centralised automated matching …