助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[1]页 共[20]条 当前为第1条到20条
 

相关语句
new heuristic algorithm
We give a new heuristic algorithm for minimum matching problems and apply it to the Euclidean problem with random vertices in 2 dimensions.
      
This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet.
      
This paper presents a new heuristic algorithm for computing a compact hierarchical representation of the objects contained in a 3D static scene.
      
Moreover, in Part II a new heuristic algorithm for solving both versions of the 2BP is presented and computational results on test problems from the literature are given in order to evaluate the effectiveness of the proposed lower bounds.
      
This paper proposes a new heuristic algorithm that triangulates a set ofn points inO(n3) time and that never produces a triangulation whose weight is greater than that of a greedy triangulation.
      
We report a new heuristic algorithm useful for developing least-cost expansion plans for leased telecommunications networks in which there is a hierarchy of possible transmission facilities.
      
A new heuristic algorithm to perform tabu search on the Quadratic Assignment Problem (QAP) is developed.
      
After drawing up a synthesis of existing work which addresses this type of problems, we propose a new heuristic algorithm which is based on the machine workload to find an efficient permutation schedule.
      
A new heuristic algorithm, based on the tabu search methodology, is proposed for constrained redundancy optimization in series and in complex systems.
      
This manuscript presents a new heuristic algorithm to find near optimal integer solutions for the singly constrained assignment problem.
      
A new heuristic algorithm solving the linear ordering problem
      
In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm.
      
This paper presents a new heuristic algorithm for designing least-cost telecommunications networks to carry cell site traffic to wireless switches while meeting survivability, capacity, and technical compatibility constraints.
      
In addition the new heuristic algorithm for solving a bimatrix game problem is investigated.
      
By discrete-event simulation we compare various routing strategies in terms of blocking probability and we propose a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account.
      
This article proposes a new heuristic algorithm, called Shared Multi-sub-backup-paths Reprovisioning (SMR), to improve the survivability for multi-link failures in WDM mesh networks.
      
A new heuristic algorithm for this problem is proposed in section 3.
      
Both lightpath routing and wavelength assignment are obtained through a new heuristic algorithm, called GDAP, and described in Section IV.
      
For solving the dominating set problem we developed a new heuristic algorithm.
      
We show the relevance of a particular novel class of ordering problems, and then introduce a non-trivial new heuristic algorithm for this class.
      
 

首页上一页1下一页尾页 

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