助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   improved tabu search 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.089秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
电力工业
更多类别查询

图标索引 历史查询
 

improved tabu search
相关语句
  改进的禁忌搜索
    In this paper,an improved tabu search algorithm(ITS)is used to optimize the parameters of HMM.
    文章提出了一种改进的禁忌搜索(ITS,ImprovedTabuSearch)优化HMM的参数。
短句来源
  改进的禁忌搜索
    In this paper,an improved tabu search algorithm(ITS)is used to optimize the parameters of HMM.
    文章提出了一种改进的禁忌搜索(ITS,ImprovedTabuSearch)优化HMM的参数。
短句来源
  “improved tabu search”译为未确定词的双语例句
    Optimization of Discrete Hidden Markov Model Based on an Improved Tabu Search Algorithm
    基于一种改进禁忌搜索算法优化离散隐马尔可夫模型
短句来源
    Improved Tabu Search Algorithm for Vehicle Routing Problem
    一种基于禁忌搜索算法的车辆路径问题的改进算法
短句来源
查询“improved tabu search”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Hidden Markov model(HMM)is a statistical pattern recognition method that is extensively used in speech and gesture recognition.In this paper,an improved tabu search algorithm(ITS)is used to optimize the parameters of HMM.Traditional tabu search algorithm(TS)is combined with local search algorithm,maximum likelihood(ML )algorithm,which speeds the convergence of the algorithm and can get better solutions.TS and ITS are applied to training HMM for dynamic gesture recognition.The results...

Hidden Markov model(HMM)is a statistical pattern recognition method that is extensively used in speech and gesture recognition.In this paper,an improved tabu search algorithm(ITS)is used to optimize the parameters of HMM.Traditional tabu search algorithm(TS)is combined with local search algorithm,maximum likelihood(ML )algorithm,which speeds the convergence of the algorithm and can get better solutions.TS and ITS are applied to training HMM for dynamic gesture recognition.The results show that ITS can get higher recognition rate,and find the optimal model parameters.

隐马尔可夫模型(HMM,HiddenMarkovModel)是语音识别和手势识别中广泛使用的统计模式识别方法。文章提出了一种改进的禁忌搜索(ITS,ImprovedTabuSearch)优化HMM的参数。传统的TabuSearch(TS)与局部搜索算法(极大似然法)交替进行,从而加快了算法的收敛速度,并得到优化解。分别用TS及ITS训练隐马尔可夫模型进行动态手势识别。结果表明ITS可获得更高的识别率,且能达到全局优化。

An improved tabu search-crossover tabu search(CTS)was proposed,which is applied for solving a well-known combinatorial optimization problem--the traveling salesman problem(TSP).The key strategies of the CTS are intensification strategy and diversification strategy.Intensification strategies,based on modifying choice rules to encourage move combinations,were used to enhance the efficiency of local search.Diversifications strategies were designed to drive the search into new regions,i.e.,exploit...

An improved tabu search-crossover tabu search(CTS)was proposed,which is applied for solving a well-known combinatorial optimization problem--the traveling salesman problem(TSP).The key strategies of the CTS are intensification strategy and diversification strategy.Intensification strategies,based on modifying choice rules to encourage move combinations,were used to enhance the efficiency of local search.Diversifications strategies were designed to drive the search into new regions,i.e.,exploit the new search spaces.The CTS implement the crossover operator of the genetic algorithm(GA)as the diversification strategy,and the strategy for selecting elite solutions as the intensification strategy.CTS,standard TS,standard TS with intensification strategy and ant colony system(ACS)were used to solve the same TSP problems which come from the library of TSP instances TSPLIB and other three TSP instances of Fogel's path.The results show better CTS performances than other kinds of algorithms.

提出一种改进的禁忌搜索(TS)—交叉禁忌搜索(CTS),并用于混合优化问题旅行商问题(TSP)的求解。CTS主要包括集中策略和分散策略。采用选择规律的改变促进移动的混合,集中策略增强了算法的局部搜索能力;分散策略是用于开辟新的搜索空间。在CTS中,采用遗传算法中的交叉算子作为分散策略,优解选择法作为集中策略。CTS、标准TS、带集中策略的TS和蚁群算法用于求解相同的TSP例子,所用例子都是来自TSPLIB例子库和Fogel路径。求解结果显示了CTS的性能优于其它算法。

This paper describes the vehicle routing problem briefly and presents an improved tabu search algorithm.Through expanded searching-area,the new algorithm can obtain the high quality solutions.The experimental results show that the improved algorithm is feasible and valid for the VRP.

针对车辆路径问题,提出了一种改进的禁忌搜索算法,通过从当前解的正序和倒序2个方向同时进行邻域搜索,扩大了搜索的范围.实验结果表明:该算法所找到的解质量较高,能有效解决车辆路径问题.

 
图标索引 相关查询

 


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

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