GRASP:贪婪随机自适应搜索程序
GRASP是“Greedy Randomized Adaptive Search Procedure”的缩写形式,广泛应用于计算机科学领域,尤其在数据库优化、算法设计等相关场景中。该缩写便于书面及口头交流,提高了专业术语的使用效率。其中文全称为“贪婪随机自适应搜索程序”,指的是一种结合贪婪策略与随机化技术的元启发式算法,常用于求解复杂的组合优化问题。
Greedy Randomized Adaptive Search Procedure具体释义
Greedy Randomized Adaptive Search Procedure的英文发音
例句
- Assembly Workshops Scheduling Optimization Based on Advanced Greedy Randomized Adaptive Search Procedure(GRASP)
- 基于改进贪婪随机自适应算法的车间调度优化
- A greedy randomized adaptive search procedure is presented to tackle the independent tasks assignment problem in heteroge-neous environments.
- 提出了一种贪婪随机自适应搜索过程求解异构环境下的独立任务分配问题。
- Greedy randomized adaptive search procedure ( GRASP ) is a high-efficient heuristic randomly iterative algorithm, which can effectively solve the combinatorial optimization problem of transmission network planning. Each iteration includes a construction and a local search phase.
- 基于贪婪随机自适应搜索法(GRASP)能有效地解决电网规划的组合优化问题,其每一次迭代包含构造和局域搜索两阶段。
- Greedy randomized adaptive search procedure for independent tasks assignment
- 独立任务分配的贪婪随机自适应搜索过程
- Application of Greedy Randomized Adaptive Search Procedure(GRASP) in Transmission Network Planning
- 贪婪随机自适应搜索法在电网规划中的应用
本站英语缩略词为个人收集整理,可供非商业用途的复制、使用及分享,但严禁任何形式的采集或批量盗用
若GRASP词条信息存在错误、不当之处或涉及侵权,请及时联系我们处理:675289112@qq.com。