نتایج جستجو برای: complexity measures
تعداد نتایج: 662397 فیلتر نتایج به سال:
the favorable gains gleaned from the provision of pre-task planning time (ptp) have struck a chord with sla researchers as they try to manipulate task features to promote language production and development. in a similar vein, the present study is a two-fold attempt to first compare the effect of the length of pre-task planning time on discourse-analytic measures in narrative written production...
Combining complexity measures of EEG data: multiplying measures reveal previously hidden information
the major aim of this study was to investigate the relationship between social and cultural capital and efl students’ critical thinking skills. this study takes this relationship in to account to see if people with different sociocultural status are different regarding their critical thinking skills. to this end, 160 university students majoring in english language and literature, english trans...
Some natural problems seem not to be complete for any of the complexity classes we have seen so far. For example, consider the problem of taking as input a graph G and a number k, and deciding whether k is exactly the length of the shortest traveling salesperson’s tour. This is clearly related to the problem discussed in Chapter 28, Section 3, but in contrast to , it seems not to belong to NP, ...
The notion of complexity has generally been studied in the context of information theory and is closely connected with concepts, such as randomness, information, regularity, and coding (Calude, 1994). Classical information theory as well as notions of randomness, based on Shannon's concept of entropy (Shannon, 1948), relies on a priori knowledge of a probability distribution. In that respect, i...
In this paper we exploit concepts of information theory to address the fundamental problem of identifying and defining the most suitable tools to extract, in a automatic and agnostic way, information from a generic string of characters. We introduce in particular a class of methods which use in a crucial way data compression techniques in order to define a measure of remoteness and distance bet...
In 1930, Gödel [7] presented in Königsberg his famous Incompleteness Theorem, stating that some true mathematical statements are unprovable. Yet, this result gives us no idea about those independent (that is, true and unprovable) statements, about their frequency, the reason they are unprovable, and so on. Calude and Jürgensen [4] proved in 2005 Chaitin's heuristic principle for an appropriate ...
Our work focuses on various complexity measures for two-handed assembly sequences. For many products, there exist an exponentially large set of valid sequences, and a natural goal is to use automated systems to select wisely from the choices. Since assembly sequencing is a preprocessing phase for a long and expensive manufacturing process, any work towards nding a better assembly sequence is of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید