検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果:
| 書誌情報 | ファイル |
|---|---|
| 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 | |
| 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 | |
| Jointly stable matchings Miyazaki, Shuichi; Okamoto, Kazuya (2019-8) Journal of Combinatorial Optimization, 38(2): 646-665 | |