{'fraction_non_alphanumeric': 0.013565891472868217, 'fraction_numerical': 0.0, 'mean_word_length': 5.4625, '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}}
On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems

When solving a Constraint Satisfaction Problem (CSP), the order in which the variables are selected to be instantiated has implications in the complexity of the search. This work presents the first ideas for evolving hyper-heuristics as decision matrices where the elements in the matrix represent the variable ordering heuristic to apply according to the constraint density and tightness of the current instance.