نتایج جستجو برای: difficulty hierarchy

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

The aim of this paper is to assess the adequacy and desirability of applying environmental management accounting techniques and to prioritize them using the AHP method in companies with ISO 14001 certificate in Iran. As Islamic companies they adhere to Islamic principles and standards and protect the environment according to Sharia law in Islam. First, through questionnaires, we examined the de...

Journal: :CJEM 2001
R McGraw S Verma

The trainee in difficulty is someone who is either marginal or at risk of failing in his or her clinical performance. Dealing effectively with these learners can pose problems even for seasoned medical educators. This article discusses some of the common mistakes made by educators in dealing with the trainee in difficulty and offers suggestions for a systematic approach. Further, the roles of f...

2001
Ellen Gurman Bard Robin J. Lickley Matthew P. Aylett

The question addressed by this paper is whether disfluency resembles Inter-Move Interval, a measure of reaction time in conversation, in displaying effects of the overall difficulty of conducting a coherent conversation. Five sources of difficulty are considered as potential causes of disfluency: planning and producing an utterance, comprehending the prior utterance, performing a communicative ...

2011
Olana Missura Thomas Gärtner

Motivated by applications in electronic games as well as teaching systems, we investigate the problem of dynamic difficulty adjustment. The task here is to repeatedly find a game difficulty setting that is neither ‘too easy’ and bores the player, nor ‘too difficult’ and overburdens the player. The contributions of this paper are (i) the formulation of difficulty adjustment as an online learning...

Journal: :Archives of Disease in Childhood 1970

Journal: :Istanbul Bilim University Florence Nightingale Journal of Medicine 2016

2002
Lance Fortnow A. Pavan Samik Sengupta

We show that if SAT does not have small circuits, then there must exist a small number of formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that ifPNP[1℄ = PNP[2℄, then the polynomial-time hierarchy collapses to Sp2 p2 \ p2. Even showing that the hierarchy collapsed to p2 remained open prior to this paper.

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

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