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

相关语句
forward computation
Block diagram implementation of the time-recursive algorithm is described, computational complexity with respect to increasing block size is compared with straight forward computation, and the proper time-recursive block size is suggested.
      
This approach avoids forward computation on the complex geometry of irregular grids.
      
A forward computation algorithm continuously computes dynamic slices as statements are executed.
      
As far as we know, no experimental data has been published for forward computation algorithm.
      
As mentioned above, the forward computation algorithms maintain the latest dynamic slice for each variable/location.
      
Dynamic slicing is memory intensive no matter whether we use forward computation or backward computation.
      
For forward computation of UXO response, they use s=4e6 S/m and mur = 100.
      
Forward computation of data slices for this test case is shown in Table 1.
      
Forward computation of full slices for execution in case of Error 2 is shown in Table 2.
      
It is not necessary to apply the S-boxes during the forward computation.
      
In section 2, we briefly describe the existing forward computation algorithm and highlight its costs.
      
In contrast, the forward computation algorithm only provides the set of statements in the slice.
      
In Algorithm 2, we present the forward computation algorithm for finding full slice.
      
Note that the structure of this forward computation algorithm is similar to the forward computation algorithm for data slicing.
      
Next we describe the forward computation algorithm for updating relevant slices.
      
So, a total of sixteen activation values are presented at the time of forward computation.
      
To avoid large hardware overhead, the complexity of the inverse process should be much smaller than that of the forward computation.
      
Thus, the main calculation costs of a forward computation are to be expected in the equation solution procedure.
      
Therefore it is apparent that the cost of forward computation of dynamic slices is very high.
      
Therefore we decided to use forward computation method in this work.
      
 

首页上一页12下一页尾页 

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