The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—In this paper we present new methods for the automated learning of heuristics in knowledge-lean applications and for finding heuristics that can be generalized to unlearned domains. These applications lack domain knowledge for credit assignment; hence, operators for composing new heuristics are generally model-free, domain independent, and syntactic in nature. The operators we have used are genetics-based; examples of which include mutation and cross-over. Learning is based on a generate-and-test paradigm that maintains a pool of competing heuristics, tests them to a limited extent, creates new ones from those that perform well in the past, and prunes poor ones from the pool. We have studied three important issues in learning better heuristics: 1) anomalies in performance evaluation, 2) rational scheduling of limited computational resources in testing candidate heuristics in single-objective as well as multiobjective learning, and 3) finding heuristics that can be generalized to unlearned domains. We show experimental results in learning better heuristics for 1) process placement for distributed-memory multicomputers, 2) node decomposition in a branch-and-bound search, 3) generation of test patterns in VLSI circuit testing, and 4) VLSI cell placement and routing.</p>
Branch-and-bound search, generalization, genetics-based learning, heuristics, knowledge-lean applications, performance evaluation, process mapping, resource scheduling, VLSI circuit testing, VLSI placement and routing..

B. W. Wah, L. Chu, A. N. Aizawa and A. Ieumwananonthachai, "Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 763-785, 1995.
83 ms
(Ver 3.3 (11022016))