Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Stable Marriage Problem). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


UCLA

1. Rosenbaum, William Bailey. Distributed Almost Stable Matchings.

Degree: Mathematics, 2016, UCLA

 The Stable Marriage Problem (SMP) is concerned with the follow scenario: suppose we have two disjoint sets of agents—for example prospective students and colleges, medical… (more)

Subjects/Keywords: Mathematics; Computer science; Economics; communication complexity; computational complexity; distributed algorithms; stable marriage problem; stable matchings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rosenbaum, W. B. (2016). Distributed Almost Stable Matchings. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6pr8d66m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Thesis, UCLA. Accessed February 23, 2020. http://www.escholarship.org/uc/item/6pr8d66m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Web. 23 Feb 2020.

Vancouver:

Rosenbaum WB. Distributed Almost Stable Matchings. [Internet] [Thesis]. UCLA; 2016. [cited 2020 Feb 23]. Available from: http://www.escholarship.org/uc/item/6pr8d66m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rosenbaum WB. Distributed Almost Stable Matchings. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/6pr8d66m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


De Montfort University

2. Al Hakami, Hosam Hasan. Stable marriage problem based adaptation for clone detection and service selection.

Degree: PhD, 2015, De Montfort University

 Current software engineering topics such as clone detection and service selection need to improve the capability of detection process and selection process. The clone detection… (more)

Subjects/Keywords: 005.1; Stable Marriage Problem; Clone Detection; Service Selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al Hakami, H. H. (2015). Stable marriage problem based adaptation for clone detection and service selection. (Doctoral Dissertation). De Montfort University. Retrieved from http://hdl.handle.net/2086/11041

Chicago Manual of Style (16th Edition):

Al Hakami, Hosam Hasan. “Stable marriage problem based adaptation for clone detection and service selection.” 2015. Doctoral Dissertation, De Montfort University. Accessed February 23, 2020. http://hdl.handle.net/2086/11041.

MLA Handbook (7th Edition):

Al Hakami, Hosam Hasan. “Stable marriage problem based adaptation for clone detection and service selection.” 2015. Web. 23 Feb 2020.

Vancouver:

Al Hakami HH. Stable marriage problem based adaptation for clone detection and service selection. [Internet] [Doctoral dissertation]. De Montfort University; 2015. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/2086/11041.

Council of Science Editors:

Al Hakami HH. Stable marriage problem based adaptation for clone detection and service selection. [Doctoral Dissertation]. De Montfort University; 2015. Available from: http://hdl.handle.net/2086/11041


University of South Africa

3. Philpin, Elizabeth Mary. Stable matching in preference relationships .

Degree: 2009, University of South Africa

 It is the aim of this paper to review some of the work done on stable matching, and on stable marriage problems in particular. Variants… (more)

Subjects/Keywords: Stable marriage; Matching algorithms; College admissions problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Philpin, E. M. (2009). Stable matching in preference relationships . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/778

Chicago Manual of Style (16th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Doctoral Dissertation, University of South Africa. Accessed February 23, 2020. http://hdl.handle.net/10500/778.

MLA Handbook (7th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Web. 23 Feb 2020.

Vancouver:

Philpin EM. Stable matching in preference relationships . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10500/778.

Council of Science Editors:

Philpin EM. Stable matching in preference relationships . [Doctoral Dissertation]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/778

4. Damianidis, Ioannis. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.

Degree: Business and IT, 2011, University of Borås

“The Stable marriage problem (SMP) is basically the problem of finding a stable matching between two sets of persons, the men and the women,… (more)

Subjects/Keywords: stable marriage problem; genetic algorithm; maximum egalitarian happiness matching; maximizing criteria; Engineering and Technology; Teknik och teknologier

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Damianidis, I. (2011). The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. (Thesis). University of Borås. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Damianidis, Ioannis. “The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.” 2011. Thesis, University of Borås. Accessed February 23, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Damianidis, Ioannis. “The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms.” 2011. Web. 23 Feb 2020.

Vancouver:

Damianidis I. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. [Internet] [Thesis]. University of Borås; 2011. [cited 2020 Feb 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Damianidis I. The Stable Marriage Problem : Optimizing Different Criteria Using Genetic Algorithms. [Thesis]. University of Borås; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20401

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.