By combining machine learning and adaptive query execution, query optimization in Presto could become smarter and more efficient over repeated use.

We present a 4/3-approximation algorithm for the problem with precedence constraints among the jobs, and two polynomial approximation schemes for the problem without precedence constraints. At the ...

We consider the problem of dynamic portfolio optimization in a discrete-time, finite-horizon setting. Our general model considers risk aversion, portfolio constraints (e. g., no short positions), ...