A Seat Assignment Information System
碩士 === 國立臺北大學 === 資訊管理研究所 === 98 === This article presents an optimal seat assignment algorithm with the minimal number of tracks, based on the famous Left-Edge Algorithm (LEA) and the data structure of hierarchical buckets. The time and space complexities are both O(N), where N is the number of tic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/09266700082473487928 |
| Summary: | 碩士 === 國立臺北大學 === 資訊管理研究所 === 98 === This article presents an optimal seat assignment algorithm with the minimal number of tracks, based on the famous Left-Edge Algorithm (LEA) and the data structure of hierarchical buckets. The time and space complexities are both O(N), where N is the number of tickets. Meanwhile, this algorithm can be applied to scheduling and channel assignment for Printed Circuit Boards (PCB) and Electronic Design Automation (EDA).
|
|---|