助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   distributed heuristic algorithm 的翻译结果: 查询用时:0.009秒
图标索引 在分类学科中查询
所有学科
电信技术
自动化技术
更多类别查询

图标索引 历史查询
 

distributed heuristic algorithm
相关语句
  分布式启发算法
     If a sink node does not exist in some wireless sensor network, and the size of the wireless sensor network is large, this thesis proposes a distributed heuristic algorithm to construct the connected dominating set using the local information of the network. The algorithm constructs 2-connected 2-dominating set.
     无线传感器网络中没有中心控制或管理节点时,本文针对传感器节点稠密分布的大规模网络,利用分布式启发算法只需获得网络局部状态信息的特点,提出了分布式启发算法构造容错性能高的2-连通2-支配集。
短句来源
     In this paper, we present a distributed heuristic algorithm, called the distributed DCLC unicast routing heuristic based on selection function (DCLC-DSF).
     本文提出一种多项式复杂度的分布式启发算法 DCL C- DSF.
短句来源
  “distributed heuristic algorithm”译为未确定词的双语例句
     (4) Study many-to-many multicast routing problem and propose two heuristic algorithms to solve delay-constrained multiple-shared multicast tree problem: SCA algorithm and distributed heuristic algorithm DISA.
     决时延约束的多共享组播树问题的算法:SCA算法和分布式算法DISA。
短句来源
     The algorithm runs on the sink node and the connected dominating set educed from the algorithm forms the virtual backbone of the network. Because the algorithm gets the global information and the information is general, the size of the connected dominating set got from the centralized heuristic algorithm is smaller than that of distributed heuristic algorithm.
     本文算法在中心控制或管理节点上运行,求得的连通支配集构成无线传感器网络的虚拟骨干网,并且由于算法采用网络的全局信息,获得的信息量较为全面,所以求得的连通支配集的规模相对于分布式算法更小。
短句来源
     This paper discusses the NP-complete multi-constrained path problem, and a distributed heuristic algorithm based on selective probing is presented.
     研究了多限制路径选择问题,提出了一种基于选择性探通术的分布式的、启发式的服务质量路由算法。
短句来源
  相似匹配句对
     A HEURISTIC THREAD SCHEDULING ALGORITHM FOR DISTRIBUTED SHARED MEMORY
     一种分布式共享存储系统的线程分配算法
短句来源
     A Heuristic Algorithm for Task Allocation on Distributed Multiprocessor Systems
     一种多处理机任务分配的启发式算法
短句来源
     AN IMPROVED HEURISTIC ALGORITHM FOR TASK ASSIGNMENT IN DISTRIBUTED SYSTEMS
     一种改进的启发式任务分配算法
短句来源
     Heuristic Algorithm and Online Decryption
     启发式算法与在线式解析
短句来源
     Distributed realization of the algorithm has been discussed.
     另外,还讨论了算法的分布式实现方法。
短句来源
查询“distributed heuristic algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  distributed heuristic algorithm
In this paper, a new distributed heuristic algorithm based on ant colony optimization for dynamic RWA is put forward.
      
Then, since in an ad-hoc network there is no central authority that is responsible for network optimization, a distributed heuristic algorithm is proposed.
      
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.
      


Delay-constrained least-cost unicast routing problem is NP-Complete. In this paper, we present a distributed heuristic algorithm, called the distributed DCLC unicast routing heuristic based on selection function (DCLC-DSF). DCLC-DSF, which is a dynamic routing algorithm with re-routing and negotiation mechanism, only requires the local information to be kept at each node: the delay and cost of neighbor links. In the worst case, Its message complexity of DCLC-DSF is O(e\+2), and the computation...

Delay-constrained least-cost unicast routing problem is NP-Complete. In this paper, we present a distributed heuristic algorithm, called the distributed DCLC unicast routing heuristic based on selection function (DCLC-DSF). DCLC-DSF, which is a dynamic routing algorithm with re-routing and negotiation mechanism, only requires the local information to be kept at each node: the delay and cost of neighbor links. In the worst case, Its message complexity of DCLC-DSF is O(e\+2), and the computation complexity of each node is O(n\+2). While for a stable network, the message complexity is O(e). The simulation results also show that, on the average, DCLC-DSF requires much fewer messages. Therefore, DCLC-DSF scales well to large-scale networks. We picture the protocol of DCLC-DSF by a finite state machine. We also use simulation to compare DCLC-DSF to the optimal DCLC algorithm CBF and the least-delay path algorithm LDP. The results show that DCLC-DSF path costs are within 5-8% from those of the optimal solution, which proves that DCLC-DSF is a simple, accurate and robust heuristic algorithm.

Qo S路由的 DCL C单播路由 (Delay- Constrained L east- Cost Unicast Routing)问题属于 NP—完全问题 .本文提出一种多项式复杂度的分布式启发算法 DCL C- DSF.DCL C- DSF基于简单的选择函数 ,每个网络结点只需维持本地的状态信息 :相邻链路的延时和代价度量 .该算法有以下优点 :1)简单性 ;2 )动态性 ;3)重路由功能 ;4)协商功能 .在最坏情况下 ,DCL C- DSF的消息复杂度为 O(e2 ) ,结点的计算复杂度为 O(n2 ) ;在稳定的网络环境下 ,消息复杂度为 O(e) .此外 ,本文还给出 DCL C- DSF算法的有限状态机模型 .仿真实验表明 :DCL C- DSF算法的平均代价不精确度是最佳算法的 5 - 8% ,证明它是一种简单、精确、健壮的启发式算法 .

This paper analyzed optimal coverage for routing in three-dimensional wireless sensor networks.For this NP-hard combinatorial optimization problem,we proposed a new solution used techniques from Computational Geometry,Graph Coloring and established a new model for optimal coverage.We also proposed an energy-efficient distributed heuristic algorithm to find the optimal coverage routing path.Based on the model and algorithm,we presented a three-dimensional optimal coverage routing protocol in a distributed...

This paper analyzed optimal coverage for routing in three-dimensional wireless sensor networks.For this NP-hard combinatorial optimization problem,we proposed a new solution used techniques from Computational Geometry,Graph Coloring and established a new model for optimal coverage.We also proposed an energy-efficient distributed heuristic algorithm to find the optimal coverage routing path.Based on the model and algorithm,we presented a three-dimensional optimal coverage routing protocol in a distributed manner.To evaluate the performance of the algorithm,a time complexity analysis was given for each operation.In the end,we analyzed the coverage quality and compared the network lifetime with several typical protocols.Simulation results show that proposed routing protocol has low time complexity and it is considerably effective,scalable and robust.

本文针对新兴无线传感器网络中的三维空间随机最佳覆盖NP难问题进行了研究.采用计算几何与图论着色方法建立了三维空间的随机最佳覆盖数学模型,给出了一种分布式启发算法,得到了完成最佳覆盖的低能量消耗路径.并在此基础上设计了一种可以实现无线传感器网络三维空间最佳覆盖的优化路由协议.最后进行了协议算法的性能评价以及最佳覆盖和网络生存时间的实验仿真,结果表明协议算法时间复杂度低,并具有可扩展性、有效性和鲁棒性.

This paper discusses the NP-complete multi-constrained path problem, and a distributed heuristic algorithm based on selective probing is presented. This algorithm employs probes to search feasible paths in parallel, and uses heuristic functions to randomly select a suitable next node. Simulation results indicate that the presented solution is efficient, scaleable, and can provide satisfying call block performance.

研究了多限制路径选择问题,提出了一种基于选择性探通术的分布式的、启发式的服务质量路由算法。算法采用探测包并行地搜索可行路径,并使用启发式函数随机选择下一跳节点。计算机仿真表明算法是有效的、可扩展的,并能提供满意的呼叫阻塞性能。

 
图标索引 相关查询

 


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

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