ダウンロード数: 126
このアイテムのファイル:
| ファイル | 記述 | サイズ | フォーマット | |
|---|---|---|---|---|
| 978-3-540-92182-0_9.pdf | 145.31 kB | Adobe PDF | 見る/開く |
完全メタデータレコード
| DCフィールド | 値 | 言語 |
|---|---|---|
| dc.contributor.author | Miyazaki, Shuichi | en |
| dc.contributor.author | Okamoto, Kazuya | en |
| dc.contributor.alternative | 宮崎, 修一 | ja |
| dc.contributor.alternative | 岡本, 和也 | ja |
| dc.date.accessioned | 2017-08-31T04:36:25Z | - |
| dc.date.available | 2017-08-31T04:36:25Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | http://hdl.handle.net/2433/226948 | - |
| dc.description | 'Algorithms and Computation' 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings | en |
| dc.description.abstract | Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive ratio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We also show that our analysis for the upper bound is tight by giving an input sequence for which the competitive ratio of our algorithm is 7 − ε for arbitrary ε> 0. | en |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | eng | - |
| dc.publisher | Springer Berlin Heidelberg | en |
| dc.rights | The final publication is available at Springer via https://doi.org/10.1007/978-3-540-92182-0_9 | en |
| dc.rights | This is not the published version. Please cite only the published version. | en |
| dc.rights | この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 | ja |
| dc.subject | 5369 | en |
| dc.title | Improving the Competitive Ratio of the Online OVSF Code Assignment Problem | en |
| dc.type | journal article | - |
| dc.type.niitype | Journal Article | - |
| dc.identifier.jtitle | Lecture Notes in Computer Science | en |
| dc.identifier.spage | 64 | - |
| dc.identifier.epage | 76 | - |
| dc.relation.doi | 10.1007/978-3-540-92182-0_9 | - |
| dc.textversion | author | - |
| dc.address | Academic Center for Computing and Media StudiesKyoto University | en |
| dc.address | Graduate School of InformaticsKyoto University | en |
| dcterms.accessRights | open access | - |
| datacite.awardNumber | 17700015 | - |
| datacite.awardNumber | 19200001 | - |
| datacite.awardNumber | 19·4017 | - |
| datacite.awardNumber | 20300028 | - |
| jpcoar.funderName | 日本学術振興会 | ja |
| jpcoar.funderName | 日本学術振興会 | ja |
| jpcoar.funderName | 日本学術振興会 | ja |
| jpcoar.funderName | 日本学術振興会 | ja |
| jpcoar.funderName.alternative | Japan Society for the Promotion of Science (JSPS) | en |
| jpcoar.funderName.alternative | Japan Society for the Promotion of Science (JSPS) | en |
| jpcoar.funderName.alternative | Japan Society for the Promotion of Science (JSPS) | en |
| jpcoar.funderName.alternative | Japan Society for the Promotion of Science (JSPS) | en |
| 出現コレクション: | 学術雑誌掲載論文等 | |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。