نتایج جستجو برای: conjunctions
تعداد نتایج: 1903 فیلتر نتایج به سال:
ion Operators We now specify the abstraction operators Absγ,L, deciding which conjunctions are added to the global tree in order to ensure coveredness for bodies of newly derived resultants. Ensuring coveredness is basically simple: add to the global tree all (unchanged) bodies of produced resultants as new, “to be partially deduced” conjunctions. However, this strategy leads usually to non-ter...
This pape~ describes an "intelligent" tutor of foreign language concepts and skills based upon state-of-the-art research in Intelligent reaching Systems and Computational Linguistics. The tutor is part of a large R&D project in ITS which resulted in a system (called DART~ for the design and development of intelligent teaching dialogues on PLATO I and in a program (called ELISA~ for teaching for...
OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor Endre Boros We consider the following problems: • Cut conjunctions in graphs: given an undirected graphG = (V,E) and a collection of vertex pairs B ⊆ V × V generate all minimal edge sets X ⊆ E such tha...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید