Search Results for author:
Found 1 papers, 0 papers with code
A Genetic Algorithm for Obtaining Memory Constrained Near-Perfect Hashing
The problem of fast items retrieval from a fixed collection is often encountered in most computer science areas, from operating system components to databases and user interfaces.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
