time complexityalgorithmentropy changeIn order to find out the limiting speed of solving a specific problem using computer, this essay provides a method based on the entropy of information. The relationship between the minimum time complexity and the information entropy change is illustrated. Several ...
calculation 翻译 calculation 翻译基本解释 ●calculation：计算，估算
StructurewereinvestigatedbyMonteCarloMultipleIntegralsonthebaseofmodifiedDNAstructurestatisticalmechanicalmodel,andtimecom plexityandprecisionwereanalyzedonthecalculatedresults. KeywordsMonteCarlomethod;Multipleintegrals;DNA;Timecomplexity;Precision Received:June15,2010 Accepted:July23,2010 ...
aThe complexity of the NC receiver is equivalent to calculation of the inverse of Nt matrices with dimensions of Nr×i,i=1,2,…,Nt. It is noteworthy that the inverse of each matrix must be calculated Nc times (one time for each subcarrier). 北卡罗来纳接收器的复杂与Nt矩阵反面的演算是等...
The complexity of the models can however be reduced by making simplifying assumptions within the different chemical reaction classes but the levels of simplification have to be carefully evaluated to make them coherent with the final aim of the model [47]. Nevertheless, many researchers have focused...
(2) measure gene functional similarity based on the corresponding hash table. There is no need to traverse the GO graph repeatedly for each method with the help of the hash table. The analysis of time complexity shows that the computational efficiency of these methods is significantly improved. ...
This paper describes new two obfuscation methods the fist method can control computational complexity and the second method can achieve semantic obfuscation. The computational complexity can be strictly controlled by using the technique of RSA encryption. The computational complexity can be arbitrarily speci...
The Complexity of Polynomial-Time Approximation In 1996 Khanna and Motwani proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putative... L Cai,M Fellows,D Juedes,... - 《Theory of Computing Systems》 被引量: 44发表: 2007年 ...
In real-time systems the evaluation structure complexity is a key factor, since it depends on the evaluation time whether the result is available in time. In this paper a modification of the conventional Mamdani-type inference system is introduced, which combines the advantages of the Mamdani and...
There is a limit on the number of activities that a single calculation job can calculate. The easiest way to limit calculation jobs is to narrow the calculation profile criteria. Because of the complexity of calculations, the current expectation is that you will limit each calculation profile to...