助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   heuristic search algorithms 在 自动化技术 分类中 的翻译结果: 查询用时:0.514秒
图标索引 在分类学科中查询
所有学科
自动化技术
计算机软件及计算机应用
工业通用技术及设备
互联网技术
更多类别查询

图标索引 历史查询
 

heuristic search algorithms
相关语句
  启发式搜索算法
    Parallel Heuristic Search Algorithms PNAO and PBHAO
    并行启发式搜索算法PANO和PBHAO
短句来源
    Iterative-Deepening Fuzzy Heuristic Search Algorithms and Their Learning Investigation
    基于反复加深的模糊启发式搜索算法及其学习性质研究
短句来源
    Based on iterative-deepening and modifying heuristic evaluation function dynamically,fuzzy heuristic search algorithms FIDA and Improved-FIDA are presented. The learning algorithm LFIDA is also presented to overcome the difficulty to design fuzzy heuristic evaluation function h (n)
    本文基于反复加深和动态修改启发式估价函数这一机制,提出了模糊启发式搜索算法FIDA和Improved-FIDA.针对模糊启发式估价函数通常难以设计这一问题,提出了可用于模糊启发式估价函数学习的学习算法LFIDA.
短句来源
    The major differences between real-time heuristic search algorithms and off-line heuristic search algorithms are summarized, and a real-time heuristic search algorithm in dynamic environments is proposed.
    讨论了实时与离线启发式搜索算法的不同,提出了动态环境中一种实时启发式搜索算法
短句来源
    The hybrid Genetic Algorithms,which combines the basic Genetic Algorithms with Greedy Algorithms,a heuristic Search Algorithms,has been applied to solve the large-scale 0-1's Knapsack Problem. And its capability is much better than the basic Genetic Algorithms and Greedy Algorithms.
    将启发式搜索算法贪心算法与基本遗传算法相结合构成的混合遗传算法在求解大规模0-1背包问题时,其性能较基本遗传算法和贪心算法都有很大的改善。
短句来源
更多       
  “heuristic search algorithms”译为未确定词的双语例句
    Ant colony algorithm is a class of heuristic search algorithms that have been successfully applied to solving NP hard problems.
    蚁群算法作为一类启发式算法,已经成功地应用于求解TSP问题。
短句来源
查询“heuristic search algorithms”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  heuristic search algorithms
For the general case (k>amp;gt;1), which is NP-hard, we review heuristic search algorithms including local search, iterative local search, and simulated annealing.
      
For the general case (k >amp;gt; 1), which is NP-hard, we review heuristic search algorithms including local search, iterative local search, and simulated annealing.
      
The optimal heuristic search algorithms like CASS and CABOB proposed for solving the WDP take a lot of CPU time for solving large problem instances.
      
Completeness and Admissibility for General Heuristic Search Algorithms-A Theoretical Study: Basic Concepts and Proofs
      
This paper compares three heuristic search algorithms: genetic algorithm (GA), simulated annealing (SA) and tabu search (TS), for hardware>amp;amp;#x2013;software partitioning.
      
更多          


This paper describes a new heuristic search algorithm with modifiable estimate.This algorithm uses the information gathered by node expansions to improve theheuristic estimate and so it keeps the so called‘consistency assumption’holding on thesearch tree constantly.The new algorithm is admissible and it reduces the worst casecomplexity of search from O(N~2)of algorithm B′(L.Méró,1984)to its O(N).(N isthe size of the searched graph.)In the other part of the paper,a comparison...

This paper describes a new heuristic search algorithm with modifiable estimate.This algorithm uses the information gathered by node expansions to improve theheuristic estimate and so it keeps the so called‘consistency assumption’holding on thesearch tree constantly.The new algorithm is admissible and it reduces the worst casecomplexity of search from O(N~2)of algorithm B′(L.Méró,1984)to its O(N).(N isthe size of the searched graph.)In the other part of the paper,a comparison between algorithm B' and the newalgorithm is made.

本文描述了一个能够改善启发函数的启发式图搜索算法。它利用搜索过程中的信息,改动启发函数 h,保持搜索树上始终满足单调限制条件,使算法的最坏复杂度从 B′的 O(N~2)(L.Mér(?),1984)降为 O(N)。本文还证明了新算法的可采纳性、线性的复杂度,并同算法 B′作了性能比较。

Unlike professor Nilsson's viewpoint, a new type of AND/OR graphs is firstly defined in this paper:the nodes of an AND/OR graph are either AND or OR but not both. And then in new AND/OR graphs, the cost of solution paths is measured by triangle norm S.Unlike the general AND/OR graph algorithm Ao*[1]AO*, the heuristic evaluation function F of AND/OR graphs is decomposed into G and H according to f=g + h for ordinary graphs. Based on this, A new AND/OR graph heuristic search algorithm NAO* is...

Unlike professor Nilsson's viewpoint, a new type of AND/OR graphs is firstly defined in this paper:the nodes of an AND/OR graph are either AND or OR but not both. And then in new AND/OR graphs, the cost of solution paths is measured by triangle norm S.Unlike the general AND/OR graph algorithm Ao*[1]AO*, the heuristic evaluation function F of AND/OR graphs is decomposed into G and H according to f=g + h for ordinary graphs. Based on this, A new AND/OR graph heuristic search algorithm NAO* is presented. The conclusion shows that the algorithm NAO* is essentially different from AO* and is admissible if H≤H*.

和Nilsson教授的观点不同,本文首先定义了一类新的AND/OR图:图中的结点或者是AND结点或者是OR结点,而不能是混合型结点,并定义其路径耗散值用三角模S来度量和计算,使其更具有普遍意义。和通常的AND/OR图AO算法不一样,本文依照普通图A算法中的启发式估价函数f=g+h,将新AND/OR图中的启发式估价函数F分成G、H两部分,并据此提出了NAO算法。本文的结论表明:NAO算法与AO算法有本质的不同;当H≤H时NAO可采纳,而且其结果极易推广到一般的AND/OR图中去。

In this paper. a new heuristic search algorithm is presented. It is able to improve the heuristic function during the searching and it has an O(N) worst-case complexity ( N is the size of the graph searched). Another result of the paper is that a new proof for "No overall optimal algorithm" has been obtained.

本文提出一个新的启发式搜索算法,它可以在搜索过程中不断改善启发函数h,使最坏复杂度降为O(N)(N是被搜索图的大小)。本文还指了L.Mcro对“无普遍最优算法”的证明中的漏洞,并给出了新的证明。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关heuristic search algorithms的内容
在知识搜索中查有关heuristic search algorithms的内容
在数字搜索中查有关heuristic search algorithms的内容
在概念知识元中查有关heuristic search algorithms的内容
在学术趋势中查有关heuristic search algorithms的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社