نتایج جستجو برای: classes

تعداد نتایج: 157446  

Journal: :Random Struct. Algorithms 2011
Peter Keevash

Weobtain a hypergraph generalisation of the graph blow-up lemma proved byKomlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 275–376, 2011

Journal: :Annales de la faculté des sciences de Toulouse Mathématiques 1995

Journal: :Advances in Mathematics of Communications 2012

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد گرمسار - دانشکده زبانهای خارجی 1389

abstract this study examines the effect of teaching lexical inferencing strategies on developing reading comprehension skill of iranian advanced efl learners. participants were female students of meraj and shokouh institudes of garmsar a quasi-experimental design using two intact advanced classes of efl students at meraj and shokouh institutes. as the first step, a general toefl proficiency te...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد گرمسار - دانشکده ادبیات و علوم انسانی 1390

abstract the present study tried to investigate the effect of visual aids (films) on the development of the speech act of disagreement among iranian efl intermediate learners. to this end, the researcher selected 40 homogeneous intermediate learners based on their scores on oxford placement test. .the subjects then divided into control group and experimental group. both classes were tested by ...

1994
Bernd Borchert

3 8 8 f ?g ? ? predicate classes promise classes Bernd Borchert Universität Heidelberg predicate classes promise function promise classes

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه گیلان - دانشکده علوم انسانی 1392

this study investigated how group formation method, namely student-selected vs. teacher-assigned, influences the results of the community model of teaching creative writing; i.e., group dynamics and group outcome (the quality of performance). the study adopted an experimental comparison group and microgenetic research design to observe the change process over a relatively short period of time. ...

Journal: :Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 1981

Journal: :Revue Forestière Française 1951

Journal: :Random Struct. Algorithms 2004
Alexandr V. Kostochka

Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k 2, then m(r, k) (k)k(r/ln r) . © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 24: 1–10, 2004

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید