加速动态规划

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science Pub Date : 1988-10-24 DOI:10.1109/SFCS.1988.21965

D. Eppstein, Z. Galil, R. Giancarlo

{"title":"加速动态规划","authors":"D. Eppstein, Z. Galil, R. Giancarlo","doi":"10.1109/SFCS.1988.21965","DOIUrl":null,"url":null,"abstract":"A number of important computational problems in molecular biology, geology, speech recognition, and other areas can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, the authors speed up the computation of several of these recurrences by one or two orders of magnitude. The algorithms used are simple and practical.<<ETX>>","PeriodicalId":113255,"journal":{"name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"70","resultStr":"{\"title\":\"Speeding up dynamic programming\",\"authors\":\"D. Eppstein, Z. Galil, R. Giancarlo\",\"doi\":\"10.1109/SFCS.1988.21965\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of important computational problems in molecular biology, geology, speech recognition, and other areas can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, the authors speed up the computation of several of these recurrences by one or two orders of magnitude. The algorithms used are simple and practical.<<ETX>>\",\"PeriodicalId\":113255,\"journal\":{\"name\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"70\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1988.21965\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1988.21965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 70

摘要

分子生物学、地质学、语音识别和其他领域的许多重要计算问题都可以用递归来表示，而递归通常是用动态规划来解决的。通过使用更复杂的数据结构，并利用应用程序的进一步结构，作者将其中一些递归的计算速度提高了一到两个数量级。所使用的算法简单实用

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Speeding up dynamic programming

A number of important computational problems in molecular biology, geology, speech recognition, and other areas can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, the authors speed up the computation of several of these recurrences by one or two orders of magnitude. The algorithms used are simple and practical.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量