AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers 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.
An approach that separates geometric visibility preprocessing from a portfolio of incremental combinatorial searches is described, complemented by exact discrete one-swap descent, ruin-and-recreate, and elite crossover.
The connection between packing and online sorting can be used not only for lower bounds, but also for algorithms, and it is proved that the same competitive ratio is achievable for other translational packing problems, including online packing of d-dimensional unit hyperdisks in R^{d+1}.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.