Author(s)

Y. Kohama, T. Takada & A. Miyamura

Abstract

One of the important subjects in AI technology is development of efficient searching technique for goals in enormous database frequently stemmed from combinatorial discrete optimality. Herein, general direction of heuris- tics is discussed, and comparison of efficiency is numerically made on a combinatorial discrete optimality of shear element in a 3D frame against torsion about a vertical axis. 1. Introduction Through the development of AI technology since the late fifties the effective searching technique was obviously a main subject to approach. Particularly, when the data-base consists of combinatorial elements, its space increases so exponentially that search for optimality becomes significantly laborious because of its nondifferentiability(Polak[l]). Such c

Keywords