検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果:
| 書誌情報 | ファイル |
|---|---|
| Approximability of two variants of multiple knapsack problems Miyazaki, Shuichi; Morimoto, Naoyuki; Okabe, Yasuo (2015) Lecture Notes in Computer Science, 9079: 365-376 |  |
| Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms Kobayashi, Koji M.; Miyazaki, Shuichi; Okabe, Yasuo (2017-05-02) Theoretical Computer Science, 675: 27-42 | |
| Approximation algorithms for the sex-equal stable marriage problem Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki (2010-11-1) ACM Transactions on Algorithms, 7(1) | |
| Better bounds for online k-frame throughput maximization in network switches Kawahara, Jun; Kobayashi, Koji M.; Miyazaki, Shuichi (2017-01-02) Theoretical Computer Science, 657(Part B): 173-190 | |
| On the advice complexity of online bipartite matching and online stable marriage Miyazaki, Shuichi (2014-12) Information Processing Letters, 114(12): 714-717 | |
絞り込み
キーワード
資料種別