排序方式： 共有22条查询结果，搜索用时 0 毫秒
21.
Branch and Bound (B&B) is a problem-solving technique which is widely used for various problems encountered in operations research and combinatorial mathematics. Various heuristic search procedures used in artificial intelligence (AI) are considered to be related to B&B procedures. However, in the absence of any generally accepted terminology for B&B procedures, there have been widely differing opinions regarding the relationships between these procedures and B&B. This paper presents a formulation of B&B general enough to include previous formulations as special cases, and shows how two well-known AI search procedures (A1 and AO1) are special cases of this general formulation. 相似文献
22.
Magnetic Resonance Materials in Physics, Biology and Medicine - 相似文献