An improved data parallel algorithm for the LSS problem

被引：0

作者：

Dosch, W ^{[1
]}

机构：

[1] Med Univ Lubeck, Inst Softwaretech & Programmiersprachen, D-23538 Lubeck, Germany

来源：

INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 13TH INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS | 1998年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents a case study for the systematic design of an abstract data parallel program. We formally derive a list homomorphic algorithm for the longest satisfying segment problem (LSS problem) from a set-oriented specification using equational and inductive reasoning.

引用

页码：111 / 116

页数：6