James C. Moore, William B. Richmond, Andrew Whinston
{"title":"计算的经济框架","authors":"James C. Moore, William B. Richmond, Andrew Whinston","doi":"10.1109/HICSS.1989.49231","DOIUrl":null,"url":null,"abstract":"The authors take a decision theoretic-approach to algorithm construction, and they view an algorithm as a formalization of a decision process. They summarize several sufficient conditions for using dynamic programming to construct optimal algorithms or decision processes. The authors interpret these conditions and their relationships to parallel and distributed processing.<<ETX>>","PeriodicalId":384442,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An economic framework for computing\",\"authors\":\"James C. Moore, William B. Richmond, Andrew Whinston\",\"doi\":\"10.1109/HICSS.1989.49231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors take a decision theoretic-approach to algorithm construction, and they view an algorithm as a formalization of a decision process. They summarize several sufficient conditions for using dynamic programming to construct optimal algorithms or decision processes. The authors interpret these conditions and their relationships to parallel and distributed processing.<<ETX>>\",\"PeriodicalId\":384442,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.49231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.49231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors take a decision theoretic-approach to algorithm construction, and they view an algorithm as a formalization of a decision process. They summarize several sufficient conditions for using dynamic programming to construct optimal algorithms or decision processes. The authors interpret these conditions and their relationships to parallel and distributed processing.<>