助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   heuristic search algorithm 在 自动化技术 分类中 的翻译结果: 查询用时:0.191秒
图标索引 在分类学科中查询
所有学科
自动化技术
数学
无线电电子学
水利水电工程
计算机软件及计算机应用
航空航天科学与工程
公路与水路运输
互联网技术
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

heuristic search algorithm
相关语句
  启发式搜索算法
    Backward Heuristic Search Algorithm BHAO~* for General AND/OR Graph
    广义AND/OR图的自底向上启发式搜索算法BHAO~*
短句来源
    Research for Fuzzy Generalized And/Or Graph(Ⅰ)-Fuzzy Heuristic Search Algorithm FAO' and FAO
    模糊广义与或图的研究(Ⅰ)——模糊启发式搜索算法FAO~*′和FAO~*
短句来源
    Research for Fuzzy Generalized And/Or Graph ( Ⅱ )-Fuzzy Heuristic Search Algorithm LFAO~* with Linear Space
    模糊广义与或图的研究(Ⅱ)——具有线性存贮空间的模糊启发式搜索算法LFAO~*
短句来源
    Research of Fuzzy Generalized And/OrGraph(Ⅲ)——Parallel Fuzzy Heuristic Search Algorithm LIDFAO
    模糊广义与或图的研究(Ⅲ)——并行模糊启发式搜索算法LIDFAO
短句来源
    Backward Heuristic Search Algorithm BFAO for General AND/OR Graph
    广义AND/OR图的自底向上的启发式搜索算法BFA0
短句来源
更多       
  启发式算法
    Based on the shared memory multiprocessing environment (MIMD-SM) ,the parallel algorithm PNAO (parallel NAO) of the heuristic search algorithm NAO for newly-defined And/Or graph is presented, and the parallel algorithm PBHAO(Parallel BHAO) of the heuristic search algorithm BHAO for generalized And/Or graph is also defined.
    本文根据共享存储器的多处理机模型MIMD—SM,提出了基于新AND/OR图的并行启发式算法PNAO及基于广义AND/OR图的并行启发式算法PBHAO.
短句来源
  “heuristic search algorithm”译为未确定词的双语例句
    This paper describes a new heuristic search algorithm with modifiable estimate.
    本文描述了一个能够改善启发函数的启发式图搜索算法。
短句来源
    Based on this, A new AND/OR graph heuristic search algorithm NAO* is presented.
    本文的结论表明:NAO算法与AO算法有本质的不同;
短句来源
查询“heuristic search algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  heuristic search algorithm
To find the best model, we use a heuristic search algorithm in which the structure is determined incrementally.
      
This paper explores the use of the meta-heuristic search algorithm Simulated Annealing for solving a minimum cost network synthesis problem.
      
A system-wide multi-commodity integer network flow model and a heuristic search algorithm for the above purpose are presented and discussed in this paper.
      
We develop an approach for implementing a real time admissible heuristic search algorithm for solving project scheduling problems with resource constraints.
      
The genetic algorithm (GA) is known to be a modern heuristic search algorithm, and is suitable for solving such a problem.
      
更多          


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 presented....

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 algorithm的内容
在知识搜索中查有关heuristic search algorithm的内容
在数字搜索中查有关heuristic search algorithm的内容
在概念知识元中查有关heuristic search algorithm的内容
在学术趋势中查有关heuristic search algorithm的内容
 
 

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