検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果表示: 1-8 / 8.
- 前
- 1
- 次
検索結果:
| 書誌情報 | ファイル |
|---|---|
| Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2008-09-11) 電子情報通信学会技術研究報告, 108(206): 71-78 |  |
| A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2007-06-29) 電子情報通信学会技術研究報告, 107(127): 63-70 | |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2008) Lecture Notes in Computer Science: 64-76 | |
| A Survey of the Stable Marriage Problem and Its Variants Iwama, Kazuo; Miyazaki, Shuichi (2008) Informatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. International Conference on: 131-136 | |
| An improved approximation lower bound for finding almost stable maximum matchings Hamada, Koki; Iwama, Kazuo; Miyazaki, Shuichi (2009-08-31) Information Processing Letters, 109(18): 1036-1040 | |
| A (2-c log N/N)-Approximation Algorithm for the Stable Marriage Problem Iwama, Kazuo; Miyazaki, Shuichi; Okamoto, Kazuya (2006-08-01) IEICE TRANSACTIONS on Information and Systems, E89-D(8): 2380-2387 | |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2009-07-17) Algorithms, 2(3): 953-972 | |
| A (2-c log N/N)–Approximation Algorithm for the Stable Marriage Problem Iwama, Kazuo; Miyazaki, Shuichi; Okamoto, Kazuya (2004) Lecture Notes in Computer Science, 3111: 349-361 | |