Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain $\Omega \,\, \subset \,\, \mathbb{R}^{d}$ are presented. Conditions on the search ...

This is a preview. Log in through your library . Abstract A procedure is described which allows the selection of a simple random sample of size n from a list of N items, where N is unknown, and only ...

Machine learning and deep learning have been widely embraced, and even more widely misunderstood. In this article, I’ll step back and explain both machine learning and deep learning in basic terms, ...