This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
An increasing number of university lectures and a vast majority of company presentations are being digitally archived for redistribution today. Most of these presentations take th...
The release of general purpose GPU programming environments has garnered universal access to computing performance that was once only available to super-computers. The availability...
Aditi Rathi, Michael DeBole, Weina Ge, Robert T. C...
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...