Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: A Graph-Theoretic Framework Traces Task Planning
In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...
From Communications of the ACM
Time-Inconsistent Planning: A Computational Problem in Behavioral Economics
We propose a graph-theoretic model of tasks and goals, in which dependencies among actions are represented by a directed graph, and a time-inconsistent agent constructs...
From Communications of the ACM
Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy
"Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a...
From Communications of the ACM
Which Is the Fairest (Rent Division) of Them All?
What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation...
From Communications of the ACM
Technical Perspective: Building Bug-Free Compilers
What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.
From Communications of the ACM
Practical Verification of Peephole Optimizations with Alive
We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples...
From Communications of the ACM
Technical Perspective: Can High Performance Be Portable?
"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...
From Communications of the ACM
Halide: Decoupling Algorithms from Schedules For High-Performance Image Processing
We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.
From Communications of the ACM
Technical Perspective: Moving Spectrum
The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...
From Communications of the ACM
Deep Optimization For Spectrum Repacking
This paper describes the process by which we built the SAT-based Feasibility Checker, a crucial element of the 2016-17 U.S. FCC "incentive auction" design.
From Communications of the ACM
Technical Perspective: A Simple, Elegant Approach to Non-Numeric Parallelization
"Automatically Accelerating Non-Numerical Programs by Architecture-Compiler Co-Design," by Simone Campanoni, et al., proposes a modest hardware extension to support...
From Communications of the ACM
Automatically Accelerating Non-Numerical Programs By Architecture-Compiler Co-Design
HELIX-RC is a compiler/microprocessor co-design that opens loops to parallelization by decoupling communication from thread execution in conventional multicore...
From Communications of the ACM
Technical Perspective: Pricing Information (and Its Implications)
"A Theory of Pricing Private Data," by Chao Li, et al., introduces a fascinating and complicated issue that arises on the buy-side of the market when buyers are...
From Communications of the ACM
A Theory Of Pricing Private Data
We describe the foundations of a market in which those seeking access to data must pay for it and individuals are compensated for the loss of privacy they may suffer...
From Communications of the ACM
Technical Perspective: Exploring a Kingdom By Geodesic Measures
"The Heat Method for Distance Computation," by Crane, Weischedel, and Wardetzky, shows that the gradient of the probability density function of a random walk is...
From Communications of the ACM
The Heat Method For Distance Computation
We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains.
From Communications of the ACM
Technical Perspective: Solving Imperfect Information Games
"Heads-Up Limit Hold'em Poker Is Solved," by Michael Bowling, et al., takes the counterfactual regret minimization method for approximating a Nash equilibrium to...
From Communications of the ACM
Heads-Up Limit Hold'em Poker Is Solved
This paper is an extended version of our original 2015 Science article, with additional results showing Cepheus' in-game performance against computer and human...
From Communications of the ACM
Technical Perspective: Shedding New Light on an Old Language Debate
"A Large-Scale Study of Programming Languages and Code Quality in GitHub," by Baishakhi Ray, et al., studies whether programming language choice and code quality...
From Communications of the ACM