We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
We investigate the linear stability of a neural network with distributed delay, where the neurons are identical. We examine the stability of a symmetrical equilibrium point via th...