您要查找的是不是：
- dynamic user optimal problem 动态用户最优问题
- A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function. 运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型,给出了该模型的启发式算法。
- instantaneous dynamic user optimal (DUO) 瞬时动态用户最优
- Dynamic User Optimal Route Choice Model Considering the Length of Vehicle Queue 考虑车辆排队长度的动态用户最优路径选择模型研究
- dynamic user optimal 动态用户最优
- An equation or inequality relating the variables in an optimization problem. 在优化问题中，一种表示若干变量相互关系的方程(式)或不等式。
- Chapter 3 studies a dynamic optimal problem, which combines the optimal harvesting of two mutualistic species with the optimal utilization of productive capital. 第三章研究了将可再生资源的最优收获同生产资本的最佳利用结合起来的动态优化问题。
- The final control net is obtained by solving a nonlinear optimal problem. 重构曲线的最终控制网格可通过求解一个非线性优化问题获得。
- By using this algorithm, working optimal problem can be satisfactorily solved. 运用这一算法,较为满意地解决了这一作业优化问题。
- The common Traveling Salesman Problem(TSP) is static,but in actual life,most optimal problems are dynamic. 传统的旅行商问题都是静态的,但在现实中许多问题是动态的。
- This paper describes the user profile in user-based personalized recommender system and designs the dynamic user profile. 具体表现为在建模过程中动态提供用户偏好的分类,允许用户直接对偏好分类进行添加和删除;
- As all DUP(Dynamic User Profile)-related operations are working at the client side, the privacy of user will be fully protected. 在该系统中,所有用户私有信息的操作都在客户端执行,使用户隐私得到完善的保护。
- Again, this is a multi-variate optimization problem. 这也是一个多变量的最优化问题。
- Layout problem is a combinatory optimization problem. 布局问题是一个组合最优化问题。
- The TSP is a classic combinatorial optimization problem. TSP是经典的组合优化问题。
- Searching for the object's concavities of active contour model (Snake model) is a dynamic optimization problem. 摘要主动轮廓线模型凹陷边界点的寻优属于动态优化问题，由于其复杂性，传统方法不能准确搜索到最佳边界点。
- The result from calculational example shows that SLFA can solve the parameter optimal problem of the multi-product pipeline very well. 算例结果表明，SFLA算法可以较好地解决成品油输送管网的参数优化问题。
- The explicit expressions for the states and inputs were used to change a constrained dynamic optimization problem into an unconstrained one. 通过这些新的子状态变量，将一个受约束的动力学优化问题变成一个无约束的优化问题。
- The algorithm decomposes the complex non-linear optimal problem into three courses, according to the different constraints. 该算法将复杂的非线性优化问题根据不同的优化约束条件，分解为三个求解阶段。
- It demonstrates that the packet arrival rate, achievable service rate, user number and transmitting antenna number can be formulated into an optimization problem. 其次，将包到达速率、可达服务速率、用户数以及传输天线数构成一优化问题，得到最佳的用户组合及调度周期。
