对时序信息加工的经典研究是采用新近性判断范型，结果发现其提取机制是以新近性为基础的逆向串行搜索过程。
The temporal order information is recovered by a recency-based, backward serial retrieval process, according to the previous classic JOR(judgment of recency)study.
该文针对传统搜索算法串行处理的缺点，提出了一种基于并行处理的快速运动估计算法。
Aiming at the serial processing question existing in some typical search algorithms, this paper presents a fast motion estimation algorithm based on parallel processing principle.
它最大的优点是简单，保留了串行GA的搜索行为，因而可直接应用GA的理论来预测一个具体问题能否映射到并行ga上求解。
Its biggest advantage is simple, GA retained serial search, and can be directly applied GA theory to predict whether or not a specific issue to shine upon the combined parallel GA.
提出了一种串行路径搜索算法，能够大大减少路径搜索的计算量。
A serial path searching algorithm is proposed to reduce the computation of path searching.
对于每一行，顺序地搜索所述串行CAM单元，且选择性地并行搜索所述并行CAM单元。
For each row, the serial CAM cells are searched sequentially, and the parallel CAM cells are selectively searched in parallel.
对于每一行，顺序地搜索所述串行CAM单元，且选择性地并行搜索所述并行CAM单元。
For each row, the serial CAM cells are searched sequentially, and the parallel CAM cells are selectively searched in parallel.
应用推荐