نتایج جستجو برای: rote memorization
تعداد نتایج: 2196 فیلتر نتایج به سال:
This study assesses the effects of the use of learning strategies on student literacy performance based on the 2002 Hong Kong Program for International Student Assessment. The descriptive statistics show that students use the memorization strategy almost as frequently as the elaboration strategy. Independent sample t-tests reveal that female students prefer to use more memorization strategies a...
Memorization of the temporal sequences is very important and interesting problem. One of the examples is memorization of melodies. When we memorize melodies, we can recall it from a part. The function can be considered as an associative memory of the temporal sequences. From a technical point of view, it can be considered that the rest of the melody can be determined by some leading some notes....
For 40 years researchers have studied minimal groups using a variety of induction procedures that, surprisingly, have never been formally evaluated. The present paper reports two experiments that compared minimal group induction procedures based on (a) memorization of novel ingroup names, (b) an imagination instruction, (c) random assignment, and (d) false feedback from painting preferences. Th...
literature on artificial membrone feeding has traditionally supported the notion that mosquitoes have to be enough old to present a high gorging rote and enough young to present o high surviving rote In order to know the best mosquito age to perform a Plasmodium sp experimental infection revealed by oocyst examination, Anopheles orabiensis of known ages were fed on baudruche membrone with fresh...
Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innnite 0-1-sequences which contain 2n diierent sub-words of length n, for every n.
This paper presents a subexponential lower bound for the recently proposed snare memorization non-oblivious strategy iteration algorithm due to Fearnley. Snare memorization is a method to train policy iteration techniques to remember certain profitable substrategies and reapply them again. We show that there is not much hope to find a polynomial-time algorithm for solving parity games by applyi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید