Titlebook: Local Search for Planning and Scheduling; ECAI 2000 Workshop, Alexander Nareyek Conference proceedings 2001 Springer-Verlag Berlin Heidelb

鋼盔

978-3-540-42898-5Springer-Verlag Berlin Heidelberg 2001

移植

DIKE

antipsychotic

https://doi.org/10.1007/3-540-45612-0AI Planning; Evolutionary Algorithms; Local Search; Planning Algorithms; Planning Graphs; Search Algorith

Bouquet

Meta-heuristics: The State of the Arteering, economics and science in reasonable time horizons. In this paper we give some insight into the state of the art of meta-heuristics. This primarily focuses on the significant progress which general frames within the meta-heuristics field have implied for solving combinatorial optimization pro

北極熊

刪除

Lagrange Multipliers for Local Search on Planning Graphstasks. The space of the local search is formed by particular subgraphs of a planning graph representing partial plans. The operators for moving from one search state to the next one are graph modification operations corresponding to adding (deleting) actions to (from) a partial plan. GPG can use dif

commute

Beyond the Plan-Length Criterionare related to these resources and must take this into account in planning their behavior. In the field of artificial intelligence, resource-based action planning systems have recently begun to mushroom. However, these systems still tend to neglect resources. Conventional plan length is the primary

同義聯(lián)想法

亞麻制品