نتایج جستجو برای: teaching by demonstration impedance control
تعداد نتایج: 7783853 فیلتر نتایج به سال:
We describe a method used to prove nonexistence of pairwise balanced designs. We determine the exact closure of all subsets K of the set f3; 4
Motivation Proposal Patterns detection Patterns detection algorithm: empirical analysis Conclusion and limitations Future works
An innovative task learning system called PLOW (Procedure Learning On the Web) lets end-users teach procedural tasks to automate their various web activities. Deep natural understanding and mixed-initiative interaction in PLOW makes the teaching process very natural and intuitive while producing efficient/workable procedures.
abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...
this study was conducted to investigate the effect of favorite-text on iranian intermediate efl learners’ vocabulary development. sixty learners from nour-al-mahdi english institute participated in the present study. having been homogenized by oxford placement test (opt), they were randomly assigned into two groups of 30, control and experimental. then both groups sat for a pre-test which was a...
Providing domain knowledge needed by intelligent tutoring systems to teach a procedure to students is traditionally a difficult and time consuming task. This paper presents a system for making this process easier by allowing the automated tutor to acquire the knowledge it needs through a combination of programming by demonstration, autonomous experimentation, and direct instruction.
In this paper, we are interested inminimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n,m, wherem ≤ n, letS (n,m) be the smallest integer s for which there exists a PBD on n points whose largest block has sizem and the sum of its block sizes is equal to s. Also, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید