助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[205]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
heuristic algorithm
A heuristic algorithm is proposed for determining the maximum size of these domains of attraction.
      
A heuristic algorithm MMP-Solver is then proposed to solve the problem.
      
Then a heuristic algorithm is proposed to yield near-optimal solution efficiently.
      
We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization.
      
Based on this, a heuristic algorithm is proposed to solve the problem.
      
This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR.
      
Heuristic algorithm for off-lattice protein folding problem
      
Enlightened by the law of interactions among objects in the physical world, we propose a heuristic algorithm for solving the three-dimensional (3D) off-lattice protein folding problem.
      
A heuristic algorithm to solve the task partition problem in MDOCEM
      
We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
      
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented.
      
An effective heuristic algorithm for solving the minimum makespan problem of job shop scheduling is presented.
      
Then, a heuristic algorithm is developed to locate the optimal or near optimal solutions of the model based on the Tabu search mechanism.
      
A two-stage heuristic algorithm is proposed for the solution of the problem.
      
The first fit decreasing (FFD) heuristic algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem.
      
A heuristic algorithm is developed for the problems with the objective of minimizing the sum of rectilinear distances weighted by flow amounts between the facilities.
      
In this paper we develop an optimal and a heuristic algorithm for the problem of designing a flexible assembly line when several equipment alternatives are available.
      
The BCP Max, recently proposed, appears as the first efficient heuristic algorithm to perform the particular neuron training in the Sequential Learning.
      
In this Letter, a novel heuristic algorithm is proposed.
      
By this algorithm, the local optimum solution can be obtained certainly, and a method is provided to judge whether or not the approximate optimum solution obtained by heuristic algorithm is an optimum solution.
      
 

首页上一页12345下一页尾页 

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