ASIA unversity:Item 310904400/3869
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21654385      在线人数 : 753
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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 ©   - 回馈