"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
This paper introduces an interface-driven approach to building scalable software.
Austin T. Clements, M. Frans Kaashoek, Eddie Kohler, Robert T. Morris, Nickolai Zeldovich From Communications of the ACM | August 2017
"IronFleet: Proving Safety and Liveness of Practical Distributed Systems," by Chris Hawblitzel, et al., describes mechanically checked proofs for two non-trivial...Fred B. Schneider From Communications of the ACM | July 2017
We demonstrate the methodology on a complex implementation of a Paxos-based replicated state machine library and a lease-based sharded key-value store. With our...Chris Hawblitzel, Jon Howell, Manos Kapritsos, Jacob R. Lorch, Bryan Parno, Michael L. Roberts, Srinath Setty, Brian Zill From Communications of the ACM | July 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
We describe DeepDive, a system that combines database and machine learning ideas to help to develop knowledge base construction systems.
Ce Zhang, Christopher Ré, Michael Cafarella, Christopher De Sa, Alex Ratner, Jaeho Shin, Feiran Wang, Sen Wu From Communications of the ACM | May 2017
"Exploiting Vector Instructions with Generalized Stream Fusion" points out that stream fusion by itself is not well suited for generating bulk instructions such...Guy Blelloch From Communications of the ACM | May 2017
Programmers should not have to sacrifice code clarity or good software engineering practices to obtain performance. This work shows how to attain this goal for...Geoffrey Mainland, Roman Leshchinskiy, Simon Peyton Jones From Communications of the ACM | May 2017
"Certifying a File System Using Crash Hoare Logic: Correctness in the Presence of Crashes" presents a big step toward real-world file systems that are crash-safe...Gernot Heiser From Communications of the ACM | April 2017
This paper introduces Crash Hoare logic, which extends traditional Hoare logic with a crash condition, a recovery procedure, and logical address spaces for specifying...Tej Chajed, Haogang Chen, Adam Chlipala, M. Frans Kaashoek, Nickolai Zeldovich, Daniel Ziegler From Communications of the ACM | April 2017
What is the most drastic way to reduce the cost of communication for parallel data processing algorithms? This is the question studied in "Reasoning on Data Partitioning...Leonid Libkin From Communications of the ACM | March 2017
We introduce a framework for reasoning about data partitioning to detect when we can avoid the data reshuffling step.
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick From Communications of the ACM | March 2017