In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
In this paper, we consider two approaches to solving an optimization based design problem where “shape” is the design parameter. Both methods use domain transformations to comp...
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...