A short cut to optimal sequences

Akimasa Morihata

doi:10.1007/s00354-010-0098-4

A short cut to optimal sequences

Akimasa Morihata

Research Institute of Electrical Communication (RIEC)

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

We propose a method of developing efficient programs for finding the optimal sequence, such as the maximum valued one among those that are acceptable. We introduce a method of deriving efficient algorithms from naive enumerate-and-choose-style ones. Our method is based on shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions, and a set of auxiliary transformations. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful to describe desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

Original language	English
Pages (from-to)	31-59
Number of pages	29
Journal	New Generation Computing
Volume	29
Issue number	1
DOIs	https://doi.org/10.1007/s00354-010-0098-4
Publication status	Published - 2011 Jan 1

Keywords

Dynamic Programming
Functional Programming
Program Transformation
Shortcut Fusion

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1007/s00354-010-0098-4

Fingerprint Dive into the research topics of 'A short cut to optimal sequences'. Together they form a unique fingerprint.

Cite this

@article{e5fc525705c048db8f0e6f1ebb3f0c4f,

title = "A short cut to optimal sequences",

abstract = "We propose a method of developing efficient programs for finding the optimal sequence, such as the maximum valued one among those that are acceptable. We introduce a method of deriving efficient algorithms from naive enumerate-and-choose-style ones. Our method is based on shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions, and a set of auxiliary transformations. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful to describe desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.",

keywords = "Dynamic Programming, Functional Programming, Program Transformation, Shortcut Fusion",

author = "Akimasa Morihata",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/s00354-010-0098-4",

language = "English",

volume = "29",

pages = "31--59",

journal = "New Generation Computing",

issn = "0288-3635",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - A short cut to optimal sequences

AU - Morihata, Akimasa

PY - 2011/1/1

Y1 - 2011/1/1

N2 - We propose a method of developing efficient programs for finding the optimal sequence, such as the maximum valued one among those that are acceptable. We introduce a method of deriving efficient algorithms from naive enumerate-and-choose-style ones. Our method is based on shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions, and a set of auxiliary transformations. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful to describe desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

AB - We propose a method of developing efficient programs for finding the optimal sequence, such as the maximum valued one among those that are acceptable. We introduce a method of deriving efficient algorithms from naive enumerate-and-choose-style ones. Our method is based on shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions, and a set of auxiliary transformations. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful to describe desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

KW - Dynamic Programming

KW - Functional Programming

KW - Program Transformation

KW - Shortcut Fusion

UR - http://www.scopus.com/inward/record.url?scp=79953019957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953019957&partnerID=8YFLogxK

U2 - 10.1007/s00354-010-0098-4

DO - 10.1007/s00354-010-0098-4

M3 - Article

AN - SCOPUS:79953019957

VL - 29

SP - 31

EP - 59

JO - New Generation Computing

JF - New Generation Computing

SN - 0288-3635

IS - 1

ER -