{'fraction_non_alphanumeric': 0.014583333333333334, 'fraction_numerical': 0.0, 'mean_word_length': 5.160256410256411, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Study of the Applicability of Hopfield Decision Neural Nets to VLSI CAD

Hopfield decision neural nets have been claimed to be good for solving a class of optimization problems such as the traveling salesman's problem. A study was undertaken to determine if these techniques were applicable to the many optimization problems that occur in VLSI circuit design and layout. Module placement was chosen as a representative problem. It was observed that the convergence process closely resembles that of greedy hill climbing algorithms. Apart from the known problems of long simulation times and hardware implementation complexity, it was noted that the quality of solution was mediocre, at best, and highly sensitive to network parameters. Various modifications were attempted, none of which significantly improved the result. It is concluded that Hopfield neural nets do not, in their present form, provide an interesting solution to this class of CAD problems.