• It is important to compute the distance between objects in some fields such as packing problems, dynamic simulation systems, path planning of robots and collision detection.

    物体间距离的计算在布局问题、动态系统模拟、机器人路径规划及干涉检验等领域具有重要意义。

    youdao

  • To meet the demand of composite packing, the research development of rectangular pieces packing problems is reviewed.

    从复合材料排样的需求出发,研究了矩形件排样问题。

    youdao

  • Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.

    某些装箱问题是NP完全的,但可以通过动态规划法或近似最优的启发式解法来解决。

    youdao

  • As the extension of classical bin packing problems (BPP), coloring BPP has many important applications in multi-processor real-time scheduling.

    作为经典装箱问题的扩展,有色装箱问题在多处理器实时调度的过程中有很强的应用背景。

    youdao

  • As the extension of classical bin packing problems (BPP), coloring BPP has many important applications in multi-processor real-time scheduling.

    作为经典装箱问题的推广,有色装箱问题在多处理器实时计算机系统的任务调度等实际问题中有着很强的应用背景。

    youdao

  • In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.

    在复杂性理论中,此问题是一类重要的NP难问题,被广泛应用于调度、代码优化和生物信息学等领域。

    youdao

  • Hull curved block spatial scheduling problem was divided into a series of block sequencing problems and block packing problems by means of decomposition strategy.

    基于分解策略,将船体曲面分段空间调度问题划分为一系列分段排序和分段填空过程。

    youdao

  • These applications need optimal solutions of Cutting and Packing Problems.

    这些实际应用需要给出问题的最优解。

    youdao

  • Cutting and Packing Problems are widely occurred in the area of stock-cutting, two-Dimensional layout design and three-Dimensional layout design of many industries.

    裁剪与装填问题广泛存在于各行业的材料剪裁、平面布局设计及三维布局设计等方面。

    youdao

  • Container loading is the three-dimensional problem in "cutting and packing" problems. It is combined optimization with complex constraint condition.

    集装箱装入问题是“切割和装入”问题领域中的三维空间问题,是具有复杂约束条件的组合优化问题。

    youdao

  • Container loading is the three-dimensional problem in "cutting and packing" problems. It is combined optimization with complex constraint condition.

    集装箱装入问题是“切割和装入”问题领域中的三维空间问题,是具有复杂约束条件的组合优化问题。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定