نتایج جستجو برای: inductive c r task
تعداد نتایج: 1687545 فیلتر نتایج به سال:
A C-algebra A is deened to be purely innnite if there are no characters on A, and if for every pair of positive elements a; b in A, such that b lies in the closed two-sided ideal generated by a, there exists a sequence fr n g in A such that r n ar n ! b. This deenition agrees with the usual deenition by J. Cuntz when A is simple. It is shown that the property of being purely innnite is preserve...
Objective Bayesianism has been criticised for not allowing learning from experience: it is claimed that an agent must give degree of belief 2 to the next raven being black, however many other black ravens have been observed. I argue that this objection can be overcome by appealing to objective Bayesian nets, a formalism for representing objective Bayesian degrees of belief. Under this account, ...
This paper presents results on using a new inductive logic programming method called Foidl to learn the past tense of English verbs. The past tense task has been widely studied in the context of the symbolic/connectionist debate. Previous papers have presented results using various neural-network and decision-tree learning methods. We have developed a technique for learning a special type of Pr...
فرض کنیم x یک فضای باناخ و k یک فضای هاسدورف فشرده است. در این پایان نامه به معرفی اندازه های طیفی، شبکه های باناخ، نمایشهای پیوسته c(k) و r-کرانداری می پردازیم. هدف یافتن شرایطی است که تحت آن بتوان نمایش ?:c(k)?l(x) را به صورت انتگرال نسبت به یک اندازه ی طیفی منظم نوشت.به این منظور نخست یک شرط لازم و کافی برای وجود اندازه ی طیفی متناظر با ? ارائه می دهیم و سپس نشان می دهیم r-کرانداری نمایش ?...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید