Global ETD Search

11	Retention of paired-associates as a function of interest and retention interval using random shapes and familiar words Jones, Mary Ellen, January 1969 (has links) Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Paired-association learning. Memory.
12	The effect of pictures in three paired-associate reading experiments Smedler, Ann Charlotte, January 1900 (has links) Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 116-120). Paired-association learning.
13	A comparison of the effects of success and failure on retention of paired associates in normal children and mentally retarded children; a social learning theory interpretation. Nardi, Gabriel A. January 1965 (has links) Thesis (Ph. D.)--University of Wisconsin--Madison, 1965. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Paired-association learning.
14	The effect of stimulus labeling on paired associate learning for good and poor readers Shental, Dalia Grayefsky, January 1969 (has links) Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Reading. Paired-association learning.
15	Paired-associate learning as a function of age and a sentence's semantic structure Hurlbut, Nancy L., January 1974 (has links) Thesis (M.S.)--University of Wisconsin--Madison, 1974. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Paired-association learning.
16	The effects of pictures, imagery, and a change of context on young children's oral prose learning Steuck, Kurt W. January 1979 (has links) Thesis (M.S.)--University of Wisconsin--Madison. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 48-50). Paired-association learning.
17	Transfer in children's paired-associate learning as a function of levels of meaning Horvitz, James Mark, January 1974 (has links) Thesis (Ph. D.)--University of Wisconsin--Madison, 1974. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Paired-association learning.
18	A classroom application of the keyword method of foreign language learning McCormick, Christine. January 1979 (has links) Thesis (M.S.)--University of Wisconsin--Madison. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 47-51). Paired-association learning.
19	The role of active involvement in children's paired associate learning Javel, Mary Ellen, January 1974 (has links) Thesis (M.S.)--University of Wisconsin--Madison, 1974. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references. Paired-association learning.
20	Paired-domination in graphs McCoy, John Patrick 24 July 2013 (has links) D.Phil. (Mathematics) / Domination and its variants are now well studied in graph theory. One of these variants, paired-domination, requires that the subgraph induced by the dominating set contains a perfect matching. In this thesis, we further investigate the concept of paired-domination. Chapters 2, 3, 4, and 5 of this thesis have been published in [17], [41], [42], and [43], respectively, while Chapter 6 is under submission; see [44]. In Chapter 1, we introduce the domination parameters we use, as well as the necessary graph theory terminology and notation. We combine the de nition of a paired-dominating set and a locating set to de ne three new sets: locating-paired- dominating sets, di erentiating-paired-dominating sets, and metric-locating-paired- dominating sets. We use these sets in Chapters 3 and 4. In Chapter 2, we investigate the relationship between the upper paired-domination and upper total domination numbers of a graph. In Chapter 3, we study the properties of the three kinds of locating paired-dominating sets we de ned, and in Chapter 4 we give a constructive characterisation of those trees which do not have a di erentiating- paired-dominating set. In Chapter 5, we study the problem of characterising planar graphs with diameter two and paired-domination number four. Lastly, in Chap- ter 6, we establish an upper bound on the size of a graph of given order and paired- domination number and we characterise the extremal graphs that achieve equality in the established bound. Paired-domination Graph theory

Search results