您要查找的是不是：
- An equation or inequality relating the variables in an optimization problem. 在優(yōu)化問(wèn)題中，一種表示若干變量相互關(guān)系的方程(式)或不等式。
- The optimization problem was constructed in a prime space, the dual problem was solved in a eigenspace by the kernel skill and the solutions were the same as nonlinear KPLS. 在初始空間中構造優(yōu)化問(wèn)題，應用核技術(shù)在特征空間中解對偶問(wèn)題，這種解與非線(xiàn)性的KPLS具有相似性。
- A constrained optimization problem in primal weight space with incorporation of a regularization term was discussed.The dual problem was solved by using the kernel trick. 給出一個(gè)含有規則化項的原始權空間的約束最大優(yōu)化問(wèn)題，應用核技巧來(lái)解決其對偶問(wèn)題。
- Again, this is a multi-variate optimization problem. 這也是一個(gè)多變量的最優(yōu)化問(wèn)題。
- Layout problem is a combinatory optimization problem. 布局問(wèn)題是一個(gè)組合最優(yōu)化問(wèn)題。
- Dual optimization of seismic attributes based on Grey association analysis and K-L transform. 基于灰關(guān)聯(lián)分析與K-L變換的雙重屬性?xún)?yōu)化方法。
- The TSP is a classic combinatorial optimization problem. TSP是經(jīng)典的組合優(yōu)化問(wèn)題。
- The truck dispatching can be taken as a multivariable optimization problem. 卡車(chē)調度可以化為一個(gè)受多變量影響的最值問(wèn)題。
- Task allocation problem is a typical combinatorial optimization problem. 任務(wù)分配問(wèn)題是一類(lèi)典型的組合優(yōu)化問(wèn)題。
- The cast grouping and ordering problem of steelmaking continuous casting hot rolling (SM-CC) is a combinatorial optimization problem. 摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機流水車(chē)間調度問(wèn)題。
- Based on the K-T condition and NCP function, we present a trust region algorithm for solving minimax optimization problem. 借助于K-T條件和NCP函數,提出了處理一類(lèi)極大極小優(yōu)化問(wèn)題的信賴(lài)域算法。
- In this thesis, the generalized convexity and their applications in optimization problems such as extremum problems, dual problems, Hahn-Banach theorems and system of vector quasi-equilibrium problems etc. 本文研究廣義凸性及其在極值問(wèn)題、對偶問(wèn)題、Hahn-Banach定理和向量擬平衡系統問(wèn)題等最優(yōu)化問(wèn)題中的一些應用。
- DFP and RAGA on maximum entropy theory are proposed, an environment optimization problem is good solved. 和用基于最大熵原理的變尺度算法(DFP)利實(shí)編碼加速遺傳算法(RAGA)，解決了帶約束的環(huán)境優(yōu)化問(wèn)題。
- The genetic algorithms are used for solving the parameter inversion as an optimization problem. 利用遺傳算法求解此反演問(wèn)題的方法，把參數反演問(wèn)題轉化為優(yōu)化問(wèn)題，通過(guò)演化計算方法求解。
- The approximation for MSE is obtained and used to solve the optimization problem for design variables. 作者在MSE極小的意義下，給出辨識設計變量的解析表達式。
- Penalty function method for solving constrained (minimum) optimization problem of a class of better algorithms. 罰函數方法是求解約束（極?。﹥?yōu)化問(wèn)題的一類(lèi)較好的算法。
- The scheduling of grain logistic processes is a combinatorial optimization problem. 摘要糧食物流過(guò)程的調度是一個(gè)組合優(yōu)化問(wèn)題。
- The final control net is obtained by solving a nonlinear optimal problem. 重構曲線(xiàn)的最終控制網(wǎng)格可通過(guò)求解一個(gè)非線(xiàn)性?xún)?yōu)化問(wèn)題獲得。
- By using this algorithm, working optimal problem can be satisfactorily solved. 運用這一算法,較為滿(mǎn)意地解決了這一作業(yè)優(yōu)化問(wèn)題。
- Searching for the object's concavities of active contour model (Snake model) is a dynamic optimization problem. 摘要主動(dòng)輪廓線(xiàn)模型凹陷邊界點(diǎn)的尋優(yōu)屬于動(dòng)態(tài)優(yōu)化問(wèn)題，由于其復雜性，傳統方法不能準確搜索到最佳邊界點(diǎn)。
