Automation of testing is an essential requirement to render it viable for software development. Although there are several testing techniques and criteria in many different domains, developing methods to test programs with ...

Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a separation oracle with no further information (e. g., no domain ball containing or intersecting the set, etc.). The authors' ...

In this work we study the state of the art of Computational Complexity, focusing on classes defined around discrete probability concepts. More specifically we study four problems that are NP-intermediate candidates, the ...

Having an enormous amount of information has led to search technology. It facilitates the management of that information and minimizes the economic impact. So, for the VENUSPRO10 academic system of the Unidad Educativa ...

Stochastic convex optimization, by which the objective is the expectation of a random convex function, is an important and widely used method with numerous applications in machine learning, statistics, operations research, ...

We can program a Real-Time (RT) music improvisation system in C++ without a formal semantic or we can model it with process calculi such as the Non-deterministic Timed Concurrent Constraint (ntcc) calculus. “A Concurrent ...

© 2018, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. We propose dynamic sampled stochastic approximation (SA) methods for stochastic optimization with a heavy-tailed distribution ...

This thesis is focused on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the ...