نتایج جستجو برای: complexity of algorithms

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

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

abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...

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

abstract objectives gradual increase length and complexity of utterance (gilcu) therapy method is a form of operant conditioning. this type of treatment is very precise and controlled that is done in 54 steps in 3 speech situations consisted of monologue, reading and conversation. this study aimed to examine the effects of gilcu treatment method on reduction of speech dysfluency of school-age...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز - دانشکده ادبیات و زبانهای خارجی 1391

هدف اصلی این تحقیق بررسی تاثیر افزایش میزان پیچیدگی تکالیف مکالمه محور بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 15 الی 18 سال درسطح pre-intermediate از طریق petو vhs تست به عنوان شرکت کنندگان در تحقیق انتخاب شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی دو تکلیف ساده و پیچیده را طی 2 جلسه انجام...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیخ بهایی - دانشکده زبانهای خارجی 1391

abstract pragmatics is the study of communicative action in its sociocultural context. communicative action includes not only using speech acts (such as apologizing, complaining, complimenting, and requesting), but also engaging in different types of discourse and participating in speech events of varying length and complexity. the present study aimed to investigate the assessment of pragm...

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی - دانشکده اقتصاد 1393

due to extraordinary large amount of information and daily sharp increasing claimant for ui benefits and because of serious constraint of financial barriers, the importance of handling fraud detection in order to discover, control and predict fraudulent claims is inevitable. we use the most appropriate data mining methodology, methods, techniques and tools to extract knowledge or insights from ...

Journal: :Theory of Computing Systems 2019

Journal: :Lecture Notes in Computer Science 2021

The fragile complexity of a comparison-based algorithm is f(n) if each input element participates in O(f(n)) comparisons. In this paper, we explore the algorithms adaptive to various restrictions on input, i.e., with parameterized by quantity other than size n. We show that searching for predecessor sorted array has \(\varTheta (\log k)\), where k rank query element, both randomized and determi...

Journal: :journal of electrical and computer engineering innovations 0
somaye jalaei digital communications signal processing (dcsp) research lab., faculty of electrical engineering, shahid rajaee teacher training university (srttu), lavizan, 16788-15811, tehran, iran shahriar shirvani moghaddam digital communications signal processing (dcsp) research lab., faculty of electrical engineering, shahid rajaee teacher training university (srttu), lavizan, 16788-15811, tehran, iran

in this paper, a new approach for estimating the number of wideband sources is proposed which is based on rss or ism algorithms. numerical results show that the mdl-based and eit-based proposed algorithm havea much better detection performance than that in egm and aic cases for small differences between the incident angles of sources. in addition, for similar conditions, rss algorithm offers hi...

Journal: :Numerical Linear Algebra with Applications 2005

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

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