![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this paper, a new and very simple algorithm for mask search in SAPS (System Approach Problem Solver) is introduced to illustrate a sub-optimal approach. It is intended to be used as an alternative of the optimal mask optimization present in previous versions of SAPS.
The algorithm described in this paper illustrates the general use of non-optimal search strategies. It is based on the hill-climbing strategy and as such it is not exponential as in all known previous versions of SAPS, but polynomial in nature. This results in an improved executing speed; very complex systems that were intractable with previous versions of SAPS can be handled with additional flexibility. The previous (exponential) algorithm is also implemented. Hence, comparisons and benchmarks are possible because of the same object-oriented environment. The main focus in this paper will lie on the justification for sub-optimal mask search techniques and its illustration with the algorithm