ASIA unversity:Item 310904400/3869
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21693964      線上人數 : 612
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/3869


    題名: The necessary and sufficient condition for the worst-case male optimal stable matching
    作者: Kuo, R T;Tseng, S S
    貢獻者: Department of Information Science and Applications
    關鍵詞: Algorithms;Theory;Verification
    日期: 1990
    上傳時間: 2009-11-17 11:54:22 (UTC+0)
    出版者: Asia University
    摘要: The purpose of this paper is to consider the worst-case choice for the sequential stable matching problem. We give the necessary and sufficient condition for the worst-case execution, which leads the sequential stable matching algorithm to take the maximum number of proposals. We then point out that the probability that the worst-case execution occurs when a sequential stable matching algorithm is employed is extremely small.
    關聯: Information Processing Letters 34(5):261-263
    顯示於類別:[行動商務與多媒體應用學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown477檢視/開啟
    310904400-3869.doc33KbMicrosoft Word269檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋