配对问题

具有鲁棒性的机组配对问题的随机规划模型

A Stochastic Programming Model with Robustness for Crew Pairing Problem

配对问题中的数学期望与方差的直接求法

On direct methods to the mathematical expectation and variance in the matching problem

处理括号配对问题的Systolic树

A systolic tree for parentheses matching

仿射Kac-Moody李代数的生成元配对问题

Pairing problem of generators in affine Kac-Moody Lie Algebras

目的：为了解决多克隆抗HBe抗体的来源困难和单克隆抗体的配对问题。

Objective To solve the problem of scanty supply anti-HBe polyclonal antibody with a self-prepared monoclonal antibody .

运动员最佳配对问题的回溯解法

The Backtracking Algorithm for the Optimum Partnership Problem Among Athletes

求解古典概型中配对问题的概率

Solution for Probability of Pairing Problem in Classical Probability Model

加快了启动速度，性能，并修复蓝牙的配对问题。

This increases boot speed , performance , and fixes bluetooth pairing issues .

这些方案的安全性都是基于双线性配对问题的几个难题。

The security of all these algorithms mentioned above is based on several difficult problems of bilinear pairings .

该算法利用特征值估计二维到来方向，利用特征向量的对应关系解决二维到来方向的配对问题。

It utilizes the eigenvalues to estimate 2-D DOAs and their corresponding eigenvectors to solve the pairing problem of the estimated 2-D DOAs .

该算法不涉及二维谱峰搜索，计算量小，且不存在参数的配对问题；

Because of not referring to2-D peak searching , the computational load of the algorithm is low , and the problem of pair matching does not exist in the method .

无论是否存在相干源，新算法都能精确估计出二维到达角，而无需进行谱峰搜索，从而解决了信号参数配对问题。

Without spectral peak searching , it can accurately estimate the 2 D angle and resolve the problem of parameter pairing no matter there are coherent signal sources or not .

文章以古典概型中“配对”问题的概率为例，采用一题多解的形式，给出了基本事件数的计算公式。

With pairing problems in classical probability as the example and through the forms of several solutions to one problem , the calculating formulas for basic events are presented .

因为被测辐射源信号是未知的，多辐射环境脉冲配对和信号分选问题就更为复杂。

Because the radiant signal is unknown , the problem of pulse match and signal separation becomes more complicated .

邻域粒子搜索是一种粒子配对方法，从问题域粒子中查找当前粒子的邻域粒子，为当前粒子运动提供计算条件。

Neighborhood particle search is a method which can find the neighborhood particles of the current particle from the problem domain .

分析了该类算法存在的参数配对、角度兼并问题并给出解决措施。

The problems such as parameters pair-matching and angle ambiguity of these kinds of algorithms are analyzed and the solution is proposed .

该方法将可能对应的一对投影点看成是一个配对，把原轨迹重建问题则转化为配对选择的问题，然后通过优化一个代价函数，得到最优的配对序列。

The trajectory reconstruction problem becomes a process of pairing selection . Through minimizing a cost function , we obtain the optimum pairing sequences .