The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
In linear programming linear SVMs, the bound of the VC dimension is loosened properly.
在线性规划支撑矢量机中，对其VC维数界作了适当的放宽。
In linear programming linear SVMs, the bound of the VC dimension is loosened properly.
在线性规划支撑矢量机中，对其VC维数界作了适当的放宽。
应用推荐