I’m a mathematics and computer science student at Mississippi State University and am interested in pursuing a PhD in theoretical computer science. I write here about math, algorithms, data structures, the books I’m reading, and whatever else has my attention.
Currently reading The Count of Monte Cristo.
One-line description of what this project is and why it matters. Replace this with a real project.
How do bucket-based priority queues keep their speed when an informative heuristic scatters nodes across sparse buckets? By aggregating neighboring buckets into coarser ranges, we restore density and recover the speed of bucketing for bounded-suboptimal and anytime heuristic search — without weakening solution-quality guarantees.
Coming soon.
Twenty years from now you will be more disappointed by the things that you didn’t do than by the ones you did do. So throw off the bowlines. Sail away from the safe harbor. Catch the trade winds in your sails. Explore. Dream. Discover.