Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
