AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 2 papers
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 introduction of TEPA, a revocable evidence-memory mechanism that makes validity an explicit state of memory, and the results establish lifecycle revocation as a core memory operation for agents that must falsify, audit, and later re-promote evolving knowledge.
This paper formulates test-time reasoning as a compute-allocation problem in which a system must decide whether the next unit of compute should be spent on generation, verification, or stopping, and introduces CoBa, a compute-balanced routing policy that first obtains a small set of candidates, applies cheap verification broadly, and routes uncertain or high-value candidates to stronger verification.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.