English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21651676      Online Users : 361
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/7241


    Title: A branch-and-bound algorithm for minimum-comparison sorting
    Authors: C. T. Yang;S. S. Tseng;B. M. L. Lin
    Contributors: Department of Computer Science and Information Engineering
    Date: 1995
    Issue Date: 2010-01-29 05:43:10 (UTC+0)
    Publisher: Asia University
    Relation: Proceedings of NCS‘95, R.O.C., Dec. 1995:883-841
    Appears in Collections:[行動商務與多媒體應用學系] 會議論文

    Files in This Item:

    There are no files associated with this item.



    All items in ASIAIR are protected by copyright, with all rights reserved.

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