نتایج جستجو برای: specific complexity and particular difficulties
تعداد نتایج: 16945706 فیلتر نتایج به سال:
nowadays, technical terminology translation plays an important role in human life. specific groups of people all over the world refer to learn these terminologies in order to be familiar with a subject and improve their knowledge in that domain. on the other hand, saving the technical translation equivalent is a particularly salient challenge for technical translators. the present study was con...
abstract nowadaysphotovoltaic solar cells (pvs) areacknowledged the fastest growing energy technology in the word, however, they only account for only fraction of current global renewable energy capacity. it isrecognized that this incomplete market penetration has been largely a result of the technology’sexcessive cost. so researchers are trying to find innovative, economic way with theaim of ...
most of the verbal constructions of harzani dialect have got inflectional affixes. the majority of the constructions are made up vy adding a specific verbal affix to the verbal stem (infinitive without infinitive marker). only a few number of them is formed by adding a verbal affix to the past participle of the verb. there are specific rules for the formation of different verbal types. there is...
Haemophilus influenzae, a major cause of meningitis in young children leading to death and other neurological sequelae. The disease leaves 15 to 35% of the survivors with permanent disabilities, such as, mental retardation or deafness. Despite the availability of new and more powerful antibiotics children with Hib meningitis still suffer from high mortality or morbidity. The emergence of multir...
We discuss three difficulties in applying decision theory directly to planning: the computational complexity of reasoning about probability, the difficulty of gathering knowledge of probability and the difficulty of specifying behavior using utilities. We then describe a decision theoretic planning assistant that avoids some of the problems. In particular, instead of generating plans it assists...
In many machine learning problems such as the dual form of SVM, the objective function to be minimized is convex but not strongly convex. This fact causes difficulties in obtaining the complexity of some commonly used optimization algorithms. In this paper, we proved the global linear convergence on a wide range of algorithms when they are applied to some non-strongly convex problems. In partic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید