— We describe a simple and intuitive policy gradient method for improving parametrized quadrocopter multi-flips by combining iterative experiments with information from a first...
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...