worst-case complexity
基本解釋
- [計(jì)算機(jī)科學(xué)技術(shù)]最壞情況復(fù)雜性
英漢例句
- Reasoners for OWL DL, while dealing with a decidable sublanguage, will be subject to higher worst-case complexity.
而OWL DL的推理機(jī)處理的盡管是一個(gè)可判定的子語(yǔ)言,會(huì)有更高的最壞情況復(fù)雜度。 - The most attractive property of GS-SVMs is that its computational complexity in the worst case only scales quadratically with the size of training samples.
貪婪分階段支持向量機(jī)最吸引人的優(yōu)點(diǎn)是在最差情況下,它的計(jì)算復(fù)雜度僅是訓(xùn)練樣本數(shù)的平方。 - The worst-case complexity estimate reveals that the direct applications of these algorithms are not computationally feasible for large-scale instances due to excessive memory requirements.
由于這些算法對(duì)內(nèi)存的過(guò)度需求,導(dǎo)致我們無(wú)法在合理的時(shí)間內(nèi)求解大數(shù)據(jù)量問(wèn)題。
雙語(yǔ)例句
詞組短語(yǔ)
- Worst -Case Time Complexity 時(shí)間復(fù)雜度
- worst -case iteration complexity 最壞情況下的迭代復(fù)雜性
短語(yǔ)
專業(yè)釋義
- 最壞情況復(fù)雜性