Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
给出了停机位分配问题顶点着色模型及其分解算法。
According to the FLWR expression characteristics, the algorithm is divided into three parts: decomposing the LET and FOR clause, handling RETURN clause and WHERE condition.
根据FLWR表达式的特点，算法共分为三个部分：分解FOR和LET子句、处理RETURN子句和处理WHERE条件。
The paper presents an algorithm for incremental mining which is based on pattern decomposing tree and has no need for scanning old data base.
本文提出了一个基于模式分解树，不需要扫描原数据库的增量挖掘算法。
应用推荐