...，后者的迁移效果优于前者，更能把顿悟到的知识迁移到新问题的解决之中去，即 Simon和Kaplan所谓的“元启发”（meta-heuristics）。同时研究还表明，提示和知觉 线索是影响顿悟的外部因素。
基于12个网页-相关网页
该算法利用问题的邻域知识指导局部搜索，可克服元启发式算法随机性引起的盲目搜索。
The proposed algorithm utilizes neighborhood knowledge to direct its local search procedure which can overcome the blindness or randomness introduced by meta-heuristics.
在索绪尔传统中基本的结构主义概念,启发，并塑造了赛义德,二元对立的观点。
This basic concept of structuralism in the Saussurian tradition is what creates, is what shapes binary arguments of the kind that one finds in Said.
因此本文针对标的本身的结构提出了四种启发式信息及两种求解器：二元蚁群算法及贪婪算法。
By using the intrinsic characters of this model, we design four types of heuristic information for bid and two problem solvers: the binary ant colony algorithm and the greedy algorithm.
应用推荐