搜索结果

找到约 19 项符合 bound 的查询结果

数学计算 bound-constrained SVM

bound-constrained SVM
https://www.eeworm.com/dl/641/375413.html
下载: 79
查看: 1058

数值算法/人工智能 3DBPP BRANCH AND BOUND

3DBPP BRANCH AND BOUND
https://www.eeworm.com/dl/518/427632.html
下载: 86
查看: 1127

数据结构 Algoritm branch and bound and shortest path in C

Algoritm branch and bound and shortest path in C
https://www.eeworm.com/dl/654/421020.html
下载: 124
查看: 1052

人工智能/神经网络 A branch-and-bound algorithm for asymmetric TSP

A branch-and-bound algorithm for asymmetric TSP
https://www.eeworm.com/dl/650/449375.html
下载: 185
查看: 1070

人工智能/神经网络 Solving the TSP problem using the Branch and Bound Algorithm

Solving the TSP problem using the Branch and Bound Algorithm
https://www.eeworm.com/dl/650/471312.html
下载: 191
查看: 1167

操作系统开发 作業系統RR排程方法,使用c程式來表示cpu bound & io bound (學校作業)

作業系統RR排程方法,使用c程式來表示cpu bound & io bound (學校作業)
https://www.eeworm.com/dl/531/484148.html
下载: 130
查看: 1165

Linux/Unix编程 BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF * THIS AGREEMENT. DO NOT USE

BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF * THIS AGREEMENT. DO NOT USE THE SOFTWARE UNTIL YOU HAVE CAREFULLY * READ AND AGREED TO THE FOLLOWING TERMS AND CONDITIONS.
https://www.eeworm.com/dl/619/261642.html
下载: 151
查看: 1082

其他 The basic principle using the branchand- bound strategy to solve the traveling salesperson optimiz

The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. &#1048708 There is a way to split the solution space. &#1048708 There is a way to predict a lower bound for a class of solutions. &#1048708 There is also a way ...
https://www.eeworm.com/dl/534/406521.html
下载: 193
查看: 1100

人工智能/神经网络 Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a const ...
https://www.eeworm.com/dl/650/444394.html
下载: 111
查看: 1088

系统设计方案 This my phd thesis for the WDM optical network optimization, which employs convex optimization techn

This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method and a performance bound is provided at the same ti ...
https://www.eeworm.com/dl/678/238950.html
下载: 61
查看: 1065