{'fraction_non_alphanumeric': 0.016923076923076923, 'fraction_numerical': 0.0, 'mean_word_length': 5.51, '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}}
Genetic partitioning and placement for VLSI circuits

An adaptive genetic algorithm for VLSI circuit partitioning and another for VLSI circuit placement are presented in this paper. These genetic algorithms are able to modify some of their own parameters during the search, based on their performance. These parameters are: population size, crossover rate and mutation rate. The algorithms are applied to partitioning and placement of a circuit, respectively, and their performance is compared with the performance of a non-adaptive genetic algorithm. The proposed genetic algorithms lead to significantly superior solutions in less computation time.