Dynamic programming via thinning and incrementalization

Akimasa Morihata, Masato Koishi, Atsushi Ohori

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

We demonstrate that it is useful to combine two independently studied methods, thinning and incrementalization, to develop programs that use dynamic programming. While dynamic programming is a fundamental algorithmic pattern, its development is often difficult for average programmers. There are several methods for systematically developing dynamic programming from plain problem descriptions by program transformations. We show that by combining two known methods, thinning and incrementalization, we can systematically derive efficient dynamic-programming implementations from high-level descriptions. The derivations cannot be achieved by using only one of them. We illustrate our approach with the 0-1 knapsack problem, the longest common subsequence problem, and association rule mining from numeric data.

本文言語English
ホスト出版物のタイトルFunctional and Logic Programming - 12th International Symposium, FLOPS 2014, Proceedings
出版社Springer-Verlag
ページ186-202
ページ数17
ISBN(印刷版)9783319071503
DOI
出版ステータスPublished - 2014 1月 1
外部発表はい
イベント12th International Symposium on Functional and Logic Programming, FLOPS 2014 - Kanazawa, Japan
継続期間: 2014 6月 42014 6月 6

出版物シリーズ

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

Other

Other12th International Symposium on Functional and Logic Programming, FLOPS 2014
国/地域Japan
CityKanazawa
Period14/6/414/6/6

ASJC Scopus subject areas

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

フィンガープリント

「Dynamic programming via thinning and incrementalization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル