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

图标索引 历史查询
 

heuristic search algorithm
相关语句
  启发式搜索算法
    AND/OR GRAPH HEURISTIC SEARCH ALGORITHM NAO BASED ON NORM S
    模S下的AND/OR图的启发式搜索算法NAO
短句来源
    HEURISTIC SEARCH ALGORITHM BTAO FOR GENERAL AND/OR TREE
    广义与或树的启发式搜索算法BTAO
短句来源
    Design of Universal Library of Heuristic Search Algorithm
    通用启发式搜索算法库的设计
短句来源
    A heuristic search algorithm EPA* is proposed, which is suitable for low-sensitive optimal problems.
    低灵敏度最优问题区别于一般的最优问题:总体最优性、局部满足性,本文针对它的特点给出了一个启发式搜索算法——EPA算法。
短句来源
    A HEURISTIC SEARCH ALGORITHM FOR FINDING MAXIMUN INDEPENDENT SET OF GRAPHS
    求图的最大独立集的启发式搜索算法
短句来源
更多       
  “heuristic search algorithm”译为未确定词的双语例句
    EPA~* ALGORITHM ——A HEURISTIC SEARCH ALGORITHM BASED ON CAUSE ESTIMATING AND HEREDITY PROPAGATING
    基于原因估计和继承传播计算启发函数值的搜索算法——EPA算法
短句来源
    0-1 Goal programming model and its heuristic search algorithm for publishing schedule of periodical
    稿件刊发计划的0-1目标规划模型及搜索算法
短句来源
    This paper discusses two novel methods of edge extraction--- relaxationalgorithm and heuristic search algorithm.
    论述了两种用来提取景物边缘的新兴技术——松弛迭代法和启发式搜索的方法。
短句来源
    Secondly, the thesis utilizes complex method to optimize K-means algorithm. Complex method is a heuristic search algorithm used widely for its efficient and stable result and simple procedure.
    复合形法是基于最坏点进行迭代的一种有效的随机搜索寻优方法,有着效率高,程序简单,结果稳定的特点。
短句来源
    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 presents an efficient heuristic searching algorithm, along with relative proof. The advantage of this algorithm is that the searching time and space are not connected with the size of the maze space, but with the relative position between the obstacles only. If we neglect some secondary factors, the searching time and space will only be the linear functions of the optimal path.

本文给出一个高效的启发式搜索算法和有关证明。本算法的优点是搜索的时间和空间,与迷宫空间的大小无关,仅与障碍的相对位置有关。如果忽略一些次要的因素,搜索的时间和空间仅是最佳路径的线性函数。

Under certain hypothesis a heuristic search can be considered as a random sampling process. Thus, it is possible to transfer the statistical inference method to the heuristic search. Based on the idea above, in [1] -[4] we have incorporated some specific statistical inference method into heuristic searches, and obtained some new statistical heuristic search algorithms - SA, WSA etc. The characteristics and the details of the algorithms have also been discussed.In...

Under certain hypothesis a heuristic search can be considered as a random sampling process. Thus, it is possible to transfer the statistical inference method to the heuristic search. Based on the idea above, in [1] -[4] we have incorporated some specific statistical inference method into heuristic searches, and obtained some new statistical heuristic search algorithms - SA, WSA etc. The characteristics and the details of the algorithms have also been discussed.In this paper we go further into the subject and discuss the combination of the two techniques over a wider range.

在一定的假设下,可以把启发式搜索看作一种随机取样的过程,从而可以把统计推断方法引进搜索。根据上述思想,我们在文[1—4]中,讨论了个别统计推断法与一般图(或树)搜索的结合,得到一些新的统计启发式搜索算法——如SA,WSA算法等,探讨了这类算法的优点及程序细节,本文将从理论上进一步阐述这一思想,并从更广泛的范围讨论这两种技术的结合问题。

A heuristic search algorithm EPA* is proposed, which is suitable for low-sensitive optimal problems. EPA* chooses expanded node by combining Best-First with backtracking strategies, and modifies heuristic function repeatedly by estimating the cause of increment of heuristic function value and propagating this value.

低灵敏度最优问题区别于一般的最优问题:总体最优性、局部满足性,本文针对它的特点给出了一个启发式搜索算法——EPA算法。它以A算法的基本思想为基础,并吸收回溯类算法的处理策略,运用最好优先结合回溯策略选择扩展节点,基于局部指标函数值增量的原因估计和启发函数值的继承传播实现对启发函数的多次修正计算。

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

 


 
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) 中国学术期刊(光盘版)电子杂志社