AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
1 paper indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The first smoothed analysis of the A* algorithm using inconsistent heuristics is presented, proving that the expected smoothed time complexity of inconsistent A* is bounded by a polynomial, specifically a total iteration number of $O(n^2 m \kappa)$.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.