助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   receiving item 的翻译结果: 查询用时:0.189秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

receiving item
相关语句
  相似匹配句对
     Receiving Systems
     接收系统
短句来源
     The Receiving Techniques for RDS
     RDS的接收技术
短句来源
     On the Item Storage Structure
     题库系统存储结构研究
短句来源
     On Item Cost Management
     浅谈项目成本管理
短句来源
     Improvements in mean scores of IIEF-5 and each item of IIEF-5 were significant in patients receiving Viagra compared with that of pretreatment (P<0.01).
     共有389例患者服用万艾可治疗,治疗后患者IIEF5总评分和各问题的评分均显著高于治疗前(P<0.01);
短句来源
查询“receiving item”译词为用户自定义的双语例句

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


The status of protocol development and the procedure of protocol testing are introduced.The features of different versions of the same protocol are analyzed.The next version can be considered as an extension of the current one.The extensions are divided into three sorts,received item extending,option item extending and part changing extending.The testing methods according to the changes are put forward and the testing methods according to each sort are presend.Finally the event Helloreceived of OSPFv3...

The status of protocol development and the procedure of protocol testing are introduced.The features of different versions of the same protocol are analyzed.The next version can be considered as an extension of the current one.The extensions are divided into three sorts,received item extending,option item extending and part changing extending.The testing methods according to the changes are put forward and the testing methods according to each sort are presend.Finally the event Helloreceived of OSPFv3 is used as an example to discuss our testing method.

首先分析了目前网络协议发展的现状,介绍了协议测试的一般过程.在分析了协议的前后版本之间的变化后,发现可以将这些变化看成是对当前版本的一个扩充,并将扩充分为三大类:保留项扩充、选项扩充和部分改变,相应的给出了针对各类变化的测试方法,最后以O SPFv3中的H e llorece ived事件为例介绍了提出的测试方法.

This paper considers the cross docking distribution scheduling problem,with the objective to minimize the total weighted completion times.The vehicles used in the receiving and shipping stages could be considered as machines,and the receiving items and customer demands are the processing jobs with precedence sets restrictions between them.The problem's computational complexity and some characteristics about the optimal solution were given.An efficient backward dynamic programming(DP) was developed.The...

This paper considers the cross docking distribution scheduling problem,with the objective to minimize the total weighted completion times.The vehicles used in the receiving and shipping stages could be considered as machines,and the receiving items and customer demands are the processing jobs with precedence sets restrictions between them.The problem's computational complexity and some characteristics about the optimal solution were given.An efficient backward dynamic programming(DP) was developed.The computational experiments show that the proposed DP algorithm can handle problems up to at least 25 jobs.

提出并研究两台机器环境下的以带权总完工时间为目标函数的越库配送排序问题.越库作业的入库与出库车辆被看作是排序问题中的机器,入库货物与客户需求为具有前序集限制关系的被加工工件.研究了该问题的计算复杂性及其最优解的若干性质,提出求解该问题的逆向动态规划算法,并给出了动态规划算法的数值实验.结果表明,所提出算法至少可以求解25个工件规模的越库配送排序问题.

 
图标索引 相关查询

 


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

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