نتایج جستجو برای: on average
تعداد نتایج: 8511668 فیلتر نتایج به سال:
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
the purpose of the present study was to investigate the relationship between fear of negative evaluation (fne) and communication strategies (css) among iranian efl learners. it was aimed to examine the differences in the use of communication strategies between speakers with high or low degree of fear of negative evaluation. the current study was a case study consisting of 10 english learners at...
the present study was an attempt to determine the types of motivation and levels of foreign language learning anxiety among efl students studying at azad and state universities in kermanshah and to determine the relationship between these two factors and language proficiency and gender. to this end, the foreign language learning motivation scale, by deci and ryan )1985(, were administered to 12...
One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the worst-case proved bounds, both in terms of the running time and the output quality. In this article, we investigate this puzzling statement by trying to model the average case of lattice reduction algorithms, startin...
abstract the variables affecting the nature of reading comprehension can be classified into two general categories: reader’s variables, and text variables (alderson, 2000). despite the wave of research on vocabulary knowledge as reader’s variable, the role of this knowledge in c-test as a text-dependent test and its interaction with lexical cohesion of the test as a text feature has remained a...
For a time-constructible function T we give an explicit language LT which can be recognized in time T (n). We prove that any Turing machine that recognizes LT requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy was known, but depended on languages de ned by complicated diagonalization. We also give simple proofs for t...
Subword complexity • The subword complexity c(x) of a string x is the number of distinct substrings of x (of any length) • Also called " complexity index " or " linguistic complexity " • Intuition: sequence with low complexity tend to be " repetitive " (easy to compress)
The analysis showing that our triangulation algorithm runs in linear time is incorrect, and indeed the algorithm does not run in linear time in the worst case. So far we have been unable to obtain a linear-time algorithm for the triangulation problem. We have been able to obtain an 0 (n loglogn)-time algorithm, however. The details are described in ,cAn O(n loglogn)-Time Algorithm for Triangula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید