بدائل البحث:
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
developing rd » developing a (توسيع البحث), developing _ (توسيع البحث)
rd algorithm » _ algorithms (توسيع البحث)
element » elements (توسيع البحث)
finding » findings (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
developing rd » developing a (توسيع البحث), developing _ (توسيع البحث)
rd algorithm » _ algorithms (توسيع البحث)
element » elements (توسيع البحث)
finding » findings (توسيع البحث)
-
41
Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying
منشور في 2023"…Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
42
Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité
منشور في 2009"…The first one is the GAFlow, the Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, the Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
43
New aspect-oriented constructs for security hardening concerns
منشور في 2009"…The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article