| 摘要 |
The procedure optimises algorithms, taking account of a time limit. It uses a model (1) defining the problem, heuristics (2) guiding the choice of construction of a search schema, and a library of primitives. The procedure for designing optimisation algorithms, taking account of a time limit, uses a model (1) defining the problem to be solved. Heuristics (2) are used to guide the choice of construction of a search schema, and a library of research primitives is available to describe how to construct a search schema. A further library of primitives describe the limits of exploration of the search rules, and makes available the relevant rules. An additional library of primitives describe various partial research time chains which figure in the library of research primitives, and describe the means of control of the parameters of each search (5). The limits of the search rules include indication of the branches to be explored preferentially in a search schema.
|
