Titlebook: RIMS Symposium on Software Science and Engineering II; Proceedings of the S Eichi Goto,Keijiro Araki,Taiichi Yuasa Conference proceedings 1

Confidential

,A fast parallel merging algorithm for 2–3 trees,ssors within O(log n) time. The consideration for the time complexity includes comparisons, allocation of processors, and construction of an output 2–3 tree. The algorithm is performed without read conflicts.

亲密

On equivalence transformations for term rewriting systems,ems. Using the Church-Rosser property, sufficient conditions for the equivalence of abstract reduction systems are proved. These conditions can be effectively applied to test the equivalence in a restricted domain of term rewriting systems. In addition, equivalence transformation rules for term rewriting systems are proposed.

争吵加

Evaluation of working set algorithms for data-flow machines,low programs which include branches, loops, and procedure calls. The algorithms for computing the D-, E-, and L-levels are revised and the performance for static data-flow programs is reevaluated. Algorithms to manage branches, loops, and function calls are developed. The effectiveness of these algorithms is shown through computer simulation.

转换

换话题

带伤害

0302-9743 Overview: 978-3-540-16470-8978-3-540-39809-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

Endometrium

尽管

https://doi.org/10.1007/3-540-16470-7Attribut; Computer; Fortran; Prolog; Simulation; algorithm; algorithms; computer algebra; database; design; lo

monologue

Global storage allocation in attribute evaluation,Global storage allocation in attribute evaluation was examined and a decision algorithm was given to test whether, for a given attribute grammar ., it is possible to construct an attribute grammar evaluator for . which stores values of attribute instances in storages . under storage allocation function ..

流动才波动