{"title":"专家系统的广义快速搜索","authors":"M. Karnaugh","doi":"10.1109/CAIA.1992.200007","DOIUrl":null,"url":null,"abstract":"Expert systems for applications that include the creation of a least-cost design or plan will frequently need built-in search procedures. Sometimes optimizing cannot terminate soon enough, and satisficing methods must be used. Quicksearch is a set of techniques for quickly obtaining good, but not necessarily optimal, solutions. These techniques are very specialized. The author simplifies and generalizes the quicksearch concept. Generalized quicksearch was tested, using the 15-puzzle as an example, and compared with the weighted heuristic method.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized quicksearch for expert systems\",\"authors\":\"M. Karnaugh\",\"doi\":\"10.1109/CAIA.1992.200007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Expert systems for applications that include the creation of a least-cost design or plan will frequently need built-in search procedures. Sometimes optimizing cannot terminate soon enough, and satisficing methods must be used. Quicksearch is a set of techniques for quickly obtaining good, but not necessarily optimal, solutions. These techniques are very specialized. The author simplifies and generalizes the quicksearch concept. Generalized quicksearch was tested, using the 15-puzzle as an example, and compared with the weighted heuristic method.<<ETX>>\",\"PeriodicalId\":388685,\"journal\":{\"name\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIA.1992.200007\",\"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 Eighth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1992.200007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Expert systems for applications that include the creation of a least-cost design or plan will frequently need built-in search procedures. Sometimes optimizing cannot terminate soon enough, and satisficing methods must be used. Quicksearch is a set of techniques for quickly obtaining good, but not necessarily optimal, solutions. These techniques are very specialized. The author simplifies and generalizes the quicksearch concept. Generalized quicksearch was tested, using the 15-puzzle as an example, and compared with the weighted heuristic method.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
