hash - improve hashing using genetic programming/algorithm -
Text after "
I can reduce the number of events that occur when using a hash function like the 'Conflict' that is quite confusing 'key modern table_size' I am writing. For this, I would like to use genetic programming / algorithm. But I do not know much about it. Even after reading several articles and examples, I do not know what will be the fitness function in my case (according to program definition), goal (target usually results in the necessary), as the population / individuals and parents , Etc.
Please help me with identifying this as my project and some code / pieces of pseudo code if possible.
Not necessarily to use genetic programming / algorithm, this may be anything development using programming / algorithm.
Thank you ..
My advice would be: Do not do this like this The literature on the function is huge and we understand what makes a good hash function. We know enough math, not blindly look for them. If you need a hash function to use, there is a lot to choose from there. However, if this is your Uni project and you probably can not change the subject or it's more To run in the manageable direction, as you have seen, the fitness function and the mutation operator will have complex issues to be correct. As far as I can tell from above my head, there are no clear candidates. As you can see, the 'Critical Strike Criteria' and try to see if you can think about it in terms of fitness and mutation. Another question is how do you want to represent your work? Just a Boolean expression? And, something like XOR, NOT, ROT has been created from operating? The question of fitness and mutation will be different depending on your constraints (or, instead, assumptions).
Comments
Post a Comment