1) Reranking
重排序
1.
In this paper,we divide the PCFG based Chinese Syntactic Parsing into two stages,K-best basic model and Reranking,and the second stage reranking is the emphasis of the research.
本文将基于概率上下文无关文法的汉语句法分析分为K-best基础模型和重排序两个阶段,主要研究为对多重结果的重排序技术。
2) re-ranking
重排序
1.
In this paper,a re-ranking system of web image retrieval results is constructed and simulation is made.
本文构建了一个网络图像检索结果重排序系统并进行了仿真。
3) retiming
时序重排
1.
This paper proposed a new algorithm of retiming which can be combined well with other combinational optimization methods to speed up logic circuits.
提出了一种改进时序重排算法 ,使时序重排可以更有效地与其他组合优化算法结合起来 ,共同提高同步时序电路的速度 。
2.
This paper proposes a new algorithm of retiming which can be combined well with other combinational optimization methods to speed up logic circuits.
时序重排是一种同步时序电路性能优化的重要方法 。
4) weight order
排序权重
1.
Then the possible point theory is deducted which means when the weight order gets its extremum the element of the vector equal the possible point.
针对区间判断的权重求解问题,将区间判断矩阵的样本空间映射于n(n-1)/2维向量空间,通过数学推导证明排序权重与向量的各分量之间满足一定条件下的严格单调关系,找出极值存在的可疑点,并证明了权重求解的可疑点定理。
5) rank retransmitting
排序重发
1.
Moreover,this paper proposes the rank retransmitting protocol to further improve throughput efficiency under adverse channel conditions acc.
同时结合无线光信道的特性 ,提出了RCPT/ARQ机制下的排序重发策略 ,进一步优化系统在恶劣信道条件下的链路吞吐量 。
6) rescheduling
[英][,ri:'ʃedju:l] [美][ri'skɛdʒul]
重新排序
1.
In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.
在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小。
2.
This paper considers the issue of how to rescheduling all jobs under the fixed order of the original jobs,and subject to the limit of disruptions.
在生产实际中经常会出现顾客订单不同时到达的情况,为了保证先来顾客的需求和工件本身的要求,往往是先安排好的工件保持相对顺序不变,使其与后来顾客的工件重新排序。
3.
The problem of rescheduling in the face of dynamically arriving orders is faced constantly by manufacturing companies.
重新排序问题是一种新型的排序模型。
补充资料：重排
分子式：
CAS号：
性质：见环化反应
CAS号：
性质：见环化反应
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条