Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。
A simplified objective function and a modified clonal algorithm (CLONALG) based on memory are proposed.
将二层规划目标简化为分段函数，提出基于记忆的改进克隆算法。
This paper proposes an XML update algorithm based on SAX model, which can decrease memory and time take for updating XML document.
提出一种基于SAX模型的XML文档更新算法，利用SAX模型占用时间和空间少的优点进行文档的更新。
In the part of index renewal, this paper proposed three dynamic index updating strategies based on order memory, and a kind of index dynamic updating algorithm based on chain memory.
在索引更新部分本文提出了三种顺序存储方式下准动态的索引更新策略，一种链式存储格式下索引动态更新的算法。
A novel digital image watermarking algorithm based on the association memory ability of neural network is proposed in this paper.
基于神经网络自联想记忆功能，提出了一种新的数字图像水印算法。
Parallel preconditioning algorithm based on multiprocessor systems with local memory is stressed, so that two kinds of PPCG. PPCG1 and PPCG2 are proposed.
着重讨论了基于自带存储器的多处理机系统的并行预处理算法问题，并由此提出了两种PPCG法：PPCG1和PPCG2法。
This paper presents a PWM scheme based on digital memory mode and discusses its asymmetric regular sampling principle and simple on -line algorithm.
提出一种基于数字存储模式的PWM调制方案，讨论其非对称规则采样原理，给出宜于在线运算的简便算法。
Exploiting the feature of main memory database, we put forward pre-analysis based conflict-free concurrency algorithm by determining the read and write set of the transaction in advance.
考虑到主存数据库特点，通过在事务预分析时确定事务的读写集合，文章给出了一种基于预分析的无冲突并发控制方法。
Constrained optimization evolutionary algorithm based on memory, which integrates particle swarm optimization (PSO) with differential evolution (DE), named MCOEA, is proposed.
本文作者还结合记忆策略、差异进化算法和粒子群优化算法提出记忆进化算法(MCOEA)。
The paper uses cyclic division algorithm and opening-up-memory data storage to realize rapid high-precis- ion based on fraction.
采用优化的循环除算法及开辟内存存储数据方式实现了分数的快速高精度求解。
To avoid memory access conflict, the algorithms are based on a parallel merge algorithm.
为了避免存储访问冲突，算法采用了基于并行归并的并行排序方法。
This paper proposes a 3-phase algorithm based on overlapping partitions to reduce the time and memory requirement.
该文提出一种基于重叠区的3阶段改进算法，该算法将大大减少算法的时间复杂度和空间复杂度。
This paper proposes a Memory Evolutionary Algorithm Based on Adaptive Selecting Dimension (MEABASD).
提出一种基于自适应选择维度的记忆进化算法。
This paper proposes a Memory Evolutionary Algorithm Based on Adaptive Selecting Dimension (MEABASD).
提出一种基于自适应选择维度的记忆进化算法。
应用推荐