Please use this identifier to cite or link to this item:

Title: Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization
Authors: Munera, Danny
Diaz, Daniel
Abreu, Salvador
Rossi, Francesca
Saraswat, Vijay
Codognet, Philippe
Issue Date: 16-Feb-2015
Publisher: AAAI
Citation: Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, et al. Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization. 29th AAAI Conference on Artificial Intelligence, Jan 2015, Austin, TX, United States.
Abstract: Stable matching problems have several practical applications. If preference lists are truncated and contain ties, finding a stable matching with maximal size is computationally difficult. We address this problem using a local search technique, based on Adaptive Search and present experimental evidence that this approach is much more efficient than state-of-the-art exact and approximate methods. Moreover, parallel versions (particularly versions with communication) improve performance so much that very large and hard instances can be solved quickly.
Type: article
Appears in Collections:INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica

Files in This Item:

File Description SizeFormat
SMTI-AAAI15-NC.pdf708.38 kBAdobe PDFView/Open
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois