A short cut to optimal sequences

Akimasa Morihata

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to derive efficient algorithms from naive enumerate-and-choose-style ones by shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions. In addition, we propose a set of transformations for exploiting our shortcut fusion law. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful for describing desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

本文言語English
ホスト出版物のタイトルProgramming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings
ページ63-78
ページ数16
DOI
出版ステータスPublished - 2009
外部発表はい
イベント7th Asian Symposium on Programming Languages and Systems, APLAS 2009 - Seoul, Korea, Republic of
継続期間: 2009 12月 142009 12月 16

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5904 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other7th Asian Symposium on Programming Languages and Systems, APLAS 2009
国/地域Korea, Republic of
CitySeoul
Period09/12/1409/12/16

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A short cut to optimal sequences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル