نتایج جستجو برای: time record
تعداد نتایج: 1967447 فیلتر نتایج به سال:
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
abstract the present study deals with a comparison between reactive and pre-emptive focus-on-form in terms of application and efficiency. it was conducted in an intermediate english class in shahroud. 15 male learners participated in this research and their age ranged from 18 to 25. a course book, new interchange 3, and a complementary book were used. every session the learners gave lectures o...
Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for all NP certificate schemes, infinitely often have easy acceptance certificates. We give structural ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید