Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries.
Mordecai J. GolinElfarouk HarbPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- orders of magnitude
- query processing
- brute force search
- state space
- query language
- dynamic environments
- search problems
- efficient processing
- orders of magnitude speedup
- response time
- database
- database queries
- web search engines
- recursive programs
- planning domains
- sat solvers
- heuristic search
- user queries
- query expansion
- np hard
- learning algorithm