In "Time-Inconsistent Planning: A Computational Problem in Behavioral Economics," Kleinberg and Oren describe a graph-theoretic framework for task planning with...Nicole Immorlica From Communications of the ACM | March 2018
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...Jon Kleinberg, Sigal Oren From Communications of the ACM | March 2018
"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...Vincent Conitzer From Communications of the ACM | February 2018
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...Kobi Gal, Ariel D. Procaccia, Moshe Mash, Yair Zick From Communications of the ACM | February 2018
"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...Manuel Chakravarty From Communications of the ACM | January 2018
We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.
Jonathan Ragan-Kelley, Andrew Adams, Dillon Sharlet, Connelly Barnes, Sylvain Paris, Marc Levoy, Saman Amarasinghe, Frédo Durand From Communications of the ACM | January 2018
The incentive auction scenario provides the backdrop for the breathtaking research contribution presented by Newman et al. in "Deep Optimization for Spectrum Repacking...David C. Parkes From Communications of the ACM | January 2018
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.
Neil Newman, Alexandre Fréchette, Kevin Leyton-Brown From Communications of the ACM | January 2018
"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...Aaron Roth From Communications of the ACM | December 2017
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...Chao Li, Daniel Yang Li, Gerome Miklau, Dan Suciu From Communications of the ACM | December 2017
"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...David Silver From Communications of the ACM | November 2017
This paper is an extended version of our original 2015 Science article, with additional results showing Cepheus' in-game performance against computer and human...Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin From Communications of the ACM | November 2017
"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...Jeffrey S. Foster From Communications of the ACM | October 2017
What is the effect of programming languages on software quality? In this study, we gather a very large data set from GitHub in an attempt to shed some empirical...Baishakhi Ray, Daryl Posnett, Premkumar Devanbu, Vladimir Filkov From Communications of the ACM | October 2017
"Multi-Objective Parametric Query Optimization," by Immanuel Trummer and Christoph Koch is a remarkable tour de force exploration of the combination of both parametric...Jeffrey F. Naughton From Communications of the ACM | October 2017
We propose a generalization of the classical database query optimization problem: multi-objective parametric query (MPQ) optimization.
Immanuel Trummer, Christoph Koch From Communications of the ACM | October 2017
"Exploiting the Analog Properties of Digital Circuits for Malicious Hardware," by Kaiyuan Yang, et al., assumes semiconductor foundries (and others in chip fabrication)...Charles (Chuck) Thacker From Communications of the ACM | September 2017
We show how a fabrication-time attacker can leverage analog circuits to create a hardware attack that is small and stealthy.
Kaiyuan Yang, Matthew Hicks, Qing Dong, Todd Austin, Dennis Sylvester From Communications of the ACM | September 2017
We are in the middle of the third wave of interest in artificial neural networks as the leading paradigm for machine learning. "ImageNet Classification with Deep...Jitendra Malik From Communications of the ACM | June 2017
In the 1980s backpropagation did not live up to the very high expectations of its advocates. Twenty years later, we know what went wrong: for deep neural networks...Alex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton From Communications of the ACM | June 2017