• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Automated Competitive Analysis and Computer-Aided Development Systems for Online Algorithms

Research Project

Project/Area Number 23700001
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Fundamental theory of informatics
Research InstitutionNara Institute of Science and Technology (2012-2013)
Hokkaido University (2011)

Principal Investigator

KAWAHARA Jun  奈良先端科学技術大学院大学, 情報科学研究科, 助教 (20572473)

Project Period (FY) 2011 – 2013
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Keywordsオンラインアルゴリズム / 競合比解析 / 自動解析 / kフレーム転送量最大化 / アルゴリズム / オンライン問題 / ユニットクラスタリング / フレーム転送量最大化
Research Abstract

For analyzing algorithms for online problems, which model situations without knowledge of the future, a great number of case divisions are needed in order to obtain better solutions. It is practically difficult to perform such case divisions by hand. In this research, an automated analysis technique and computer-aided development systems for online algorithms are proposed. Online algorithms for the k-frame throughput maximization problem and the online clustering problem are designed and analyzed.

Report

(4 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Research-status Report
  • 2011 Research-status Report
  • Research Products

    (4 results)

All 2013

All Presentation (4 results)

  • [Presentation] Better Bounds for Online k-Frame Throughput Maximization in Network Switches2013

    • Author(s)
      Jun Kawahara, Koji M. Kobayashi and Shuichi Miyazaki
    • Organizer
      Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013)
    • Place of Presentation
      The university of Hong Kong, Hong Kong, China(Volume 8283, Pages 218-228)
    • Related Report
      2013 Final Research Report
  • [Presentation] Optimal Buffer Management for 2-Frame Throughput Maximization2013

    • Author(s)
      Jun Kawahara and Koji M. Kobayashi
    • Organizer
      Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013)
    • Place of Presentation
      Hotel Continental Terme, Ischia, Italy(Volume 8179, Pages 274-285)
    • Related Report
      2013 Final Research Report
  • [Presentation] Optimal Buffer Management for 2-Frame Throughput Maximization2013

    • Author(s)
      Jun Kawahara
    • Organizer
      SIROCCO 2013
    • Place of Presentation
      Hotel Continental Terme, Ischia, Italy
    • Related Report
      2013 Annual Research Report
  • [Presentation] Better Bounds for Online k-Frame Throughput Maximization in Network Switches2013

    • Author(s)
      Jun Kawahara
    • Organizer
      ISAAC 2013
    • Place of Presentation
      The university of Hong Kong, Hong Kong, China
    • Related Report
      2013 Annual Research Report

URL: 

Published: 2011-08-05   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi