摘要
本文讨论了在算法合成背景下,基于解释的学习中可操作性准则问题.针对一种相对复杂的学习目标概念——算法构架,提出了实现可操作性的方法,并探讨了算法自动化系统中通用性与可操作性的制衡关系及其对系统能力的影响.
This paper discusses operability criterion of explanation-based learning in the context of automated algorithm synthesis. A method to achieve operability for algorithm scheme, a relatively complicated learning target concept is presented. Also is discussed the ge-nerality/operability trade-off in software automation system, and its influence to the system power.
出处
《计算机学报》
EI
CSCD
北大核心
1992年第12期942-946,共5页
Chinese Journal of Computers
基金
国家863高技术基金
关键词
软件自动化
算法
构架
可操作性
Algorithm synthesis, software automation, machine learning.
