نتایج جستجو برای: inductive c r task
تعداد نتایج: 1687545 فیلتر نتایج به سال:
Correct handling of names and binders is an important issue in meta-programming. This paper presents an embedding of constraint logic programming into the αML functional programming language, which provides a provably correct means of implementing proof search computations over inductive definitions involving names and binders modulo α-equivalence. We show that the execution of proof search in ...
T h e inf luence of s t imu lus modali ty and task dif f iculty on workload and perform a n c e was invest igated in the current s tudy. T h e goal ums t o quant i fy the "cost" (in t e r m s of response t i m e and ezperienced workload) incurred when essentially serial task componen t s shared c o m m o n e l emen t s (e.g., the response to one init iated the other) which could be accomplished...
The Set Cover problem has as input a set R of m items, a set C of n subsets of R and a weight function w : C → IR. The task is to choose a subset C ′ ⊆ C of minimum weight whose union contains all items of R. The sets R and C can be represented by an m × n binary matrix A that consists of a row for every item in R and a column for every subset of R in C, where an entry ai,j is 1 iff the ith ite...
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis o...
This paper focuses on a logical model of induction, and specifically of the common machine learning task of inductive concept learning (ICL). We define an inductive derivation relation, which characterizes which hypothesis can be induced from sets of examples, and show its properties. Moreover, we will also consider the problem of communicating inductive inferences between two agents, which cor...
t h e s p e c i a l c o n c e n t r i c a l l y b r a c e d f r a m e (s c b f) i s a c o m m o n t y p e o f s t e e l s t r u c t u r a l s y s t e m f o r r e s i s t i n g l a t e r a l l o a d i n g. t h i s t y p e o f s y s t e m p r o v i d e s t h e r e q u i r e d s t i f f n e s s a n d s t r e n g t h a t r e l a t i v e l y l o w c o s t. d e s i g n c o d e s, b a s e d o n p a s ...
فرض کنیم (r,m) یک حلقه ی گورنشنتاین n بعدی است، برای یک ایده آل i?r با ارتفاع c ، حلقه ی درون ریختی b=?hom?_r (h_i^c (r),h_i^c (r) ) را مورد بررسی قرار می دهیم. می توان نشان داد که b یک حلقه ی جابجایی است. در حالتی که (r,m) یک حلقه ی موضعی منظم شامل یک میدان باشد، b یک حلقه ی کوهن مکولی است. ویژگی های این حلقه وابسته به بزرگترین عدد لیوبزنیک l=?dim?_k ?ext?_r^d (k,h_i^c (r) ) است که d=dim??r?i?...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید