全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 algorithm 在 互联网技术 分类中 的翻译结果: 查询用时：0.159秒
 历史查询

 algorithm 算法(172193)
 算法
 Study on Highly Dynamic and Heterogeneous Internet Congestion Control Algorithm 高动态异构INTERNET拥塞控制算法研究 短句来源 Research on Congestion Control Algorithm in High-speed Networks 高速网络拥塞控制算法研究 短句来源 String Matching Algorithm and Application of Network Content Analysis 串匹配算法及其在网络内容分析中的应用 短句来源 AN ADAPTIVE ROUTING ALGORITHM FOR THE DISTRIBUTED OPTIMAL DOUBLE LOOP LOCAL NETWORKS 一种适用于分布式最佳双环局部网络的路由算法 短句来源 An Algorithm for Optimal Static Load Balancing Based on Local Service Strategy 一个基于局部服务策略的最优静态负载平衡算法 短句来源 更多
 “algorithm”译为未确定词的双语例句
 Formal Model of Grid Component and Optimizing Algorithm 网格构件的形式模型与优化策略 短句来源 The Research on Group Searching Algorithm of P2P Network 对等网络分组搜索算法研究 短句来源 Analysing the algorithm for finite element mesh automatic generation 有限元网格自动生成算法分析 短句来源 A Performance Analysis Algorithm for Real Time Use in IEEE 802.4 Token Bus Network IEEE 802.4 令牌总线网实时应用性能分析算法 短句来源 Results from experiment indicate that decision rule optimization algorithm can realize the rough matching of user demand and service attribute, therefore avoiding the low efficiency of traditional exact matching in exactness and maturity, so this model broadens the application field of rough sets. 结果表明,通过决策规则优化能够实现用户需求和网络服务之间的模糊匹配,从而克服了传统精确匹配的查全率低、查准率差的缺点,扩展了粗糙集的应用领域。 短句来源 更多

我想查看译文中含有：的双语例句

 algorithm
 This paper gives an algorithm for computing invariant rings of reductive groups in arbitrary characteristic. The algorithm presented here computes a geometric characteristic of this action in the case where G is connected and reductive, and $\rho$ is a morphism of algebraic groups: The algorithm takes as input the We present an algorithm for computing the invariant field k(X)G. More precisely, we give an algorithm for computing a nonempty open subset of X with a geometric quotient. We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance. 更多
 A routing algorithm with advantages of both the centralized and distributed routings is very attractive and is one of the goals chased by many network designers. Unfortunately, its updating is extremely expensive. The updating scheme proposed by the present paper, imposing a relatively light load on the network, requiring a reasonable CPU time to perform the updating algorithm in each node, and keeping the updating time within an allowable interval, provides an approach to that goal. The proposed... A routing algorithm with advantages of both the centralized and distributed routings is very attractive and is one of the goals chased by many network designers. Unfortunately, its updating is extremely expensive. The updating scheme proposed by the present paper, imposing a relatively light load on the network, requiring a reasonable CPU time to perform the updating algorithm in each node, and keeping the updating time within an allowable interval, provides an approach to that goal. The proposed algorithm consists of two phases: collecting and disseminating the routing information. By dividing a large network into small groups, it can also be used in large networks. Giving each Messenger and Full Messenger a number, the synchronization between groups and the failure recovery procedure can be easily realized. 兼有集中式和分布式优点的经路算法是很多网络设计者所关心和力争达到的目标之一,但更新经路表要花费大量的时间。本文提出一种实现这一目标的方法,其更新算法具有网络负载低、结点机执行时间短,并能在允许间隔内完成更新等优点。本算法是由收集信息和通报信息两步实现的。若把大型网络划分成几个组,则本算法也可以推广到大型网络,并且通过为每个信使和满信使赋给编号的办法,组与组之间的同步问题以及失效后的处理问题都是不难解决的。 In this paper, a model of key management in cryptosystems has been suggested. This key management is of multilevel and allocation. By this model and Vandermonde matrixes, an efficient algorithm of key management method has been developed and implemented. 本文提出了一种多级分散密钥管理的模型,根据该模型和Vandermonde矩阵的有关性质,设计和实现了一个行之有效的多级分散密钥管理的算法。 Implementation of load balancing is beneficial for the performance of distributed systems, especially for the responsive time. Having analyzed algorithms proposed, we introduce a hybrid policy composed of the local load algorithm, load information exchange algorithm, process allocation algorithm and process migration algorithm. 负载平衡是分布式系统中的一个重要研究课题,也是一个尚未解决的难题。负载平衡对于提高整个分布式系统的性能,特别是改善系统响应时间是很有意义的。本文在分析已有的算法的基础上,提出一种以分配为主、调整为辅的复合式算法来实现分布式系统的负载平衡。这个算法包括四方面的策略。即:负载的估算策略、负载信息的交换和更新策略,进程的分配策略和进程的调整策略。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8685392737388611, "perplexity": 2033.7565954400782}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570986670928.29/warc/CC-MAIN-20191016213112-20191017000612-00231.warc.gz"}