Factual
发表于 2025-3-26 22:43:53
https://doi.org/10.1007/978-1-349-22459-3opose a new algorithm that is a generalization of a similar algorithm originally developed for forward chaining production systems. The time complexity of the proposed method is not better than that of a naive solution, in the worst case. In the best case, however, a significant speedup can be achie
大暴雨
发表于 2025-3-27 03:01:57
http://reply.papertrans.cn/39/3880/387926/387926_32.png
diabetes
发表于 2025-3-27 08:03:47
http://reply.papertrans.cn/39/3880/387926/387926_33.png
exostosis
发表于 2025-3-27 09:35:26
Cycle chain code picture languages,s by the requirement that certain subpictures must be cycles or elementary cycles. We investigate basic properties of context-free cycle and elementary cycle grammars with emphasis on the complexity of the recognition problem. In particular, it is shown that the description complexity is polynomial
弹药
发表于 2025-3-27 14:08:22
https://doi.org/10.1007/978-1-4302-1127-3 NP-complete problem, even for binary trees. Therefore, we design layout graph grammars which guarantee polynomial time constructions of optimal layouts of graphs. This is achieved by the restriction to polynomial graph grammars and layout specifications, which can be computed efficiently by an attr
homeostasis
发表于 2025-3-27 19:50:01
http://reply.papertrans.cn/39/3880/387926/387926_36.png
enhance
发表于 2025-3-27 23:18:14
Panel discussion: The use of graph grammars in applications,
南极
发表于 2025-3-28 04:18:36
Presentation of the , An Integrated and Incremental Project Support ENviroment,
tariff
发表于 2025-3-28 08:16:39
Presentation of the , A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems,
GEAR
发表于 2025-3-28 13:51:03
Graph Grammars and Their Application to Computer Science