20 results for “Algorithm engineering”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Improves the sparse ruling-set algorithm for list ranking to scale to large machines and input sizes.
This paper introduces Algorithm-Driven Development (ADD), a methodology that translates requirements into algorithmic flowcharts and links requirement modeling with automated test generation to improv…
The paper demonstrates the potential of using LLMs within verifier-guided evolutionary coding agents to develop and improve algorithms, specifically applied to contraction order optimization in tensor…
Jian Yao, Zhiyao Zhang, Yichen Li, Xingyu Wu +1 more
This paper introduces Algorithm Modelization, a paradigm that turns iterative algorithms into trainable models.
Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more
This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.
Teaching Software Engineering for AI-enabled systems
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.
The paper introduces The AI Telco Engineer (AITE), a framework for autonomously designing wireless communication algorithms using large language models, achieving better performance and reduced latenc…
The paper introduces two library combinators, prune and defrel/bank, to bring observational deduplication and bottom-up enumeration into the relational setting using plain miniKanren.
Ignacio Cano, Amir Saadat, Rishipal Singh Bhatia, Samuel Ginzburg +18 more
This paper presents a methodology for verifying and triaging a compiler at hyperscale using fuzzing techniques and AI agent swarms.
This paper analyzes the efficiency of AI coding agents and identifies the opportunity for reducing unnecessary turns in their loop engineering process.
KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…
The paper introduces CHECKMATE, a novel framework that uses code evolution to automatically generate and optimize algorithms for complex combinatorial problems, outperforming state-of-the-art solvers.
The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.
The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…