We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...