Sciweavers

1059 search results - page 16 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
JPDC
2007
81views more  JPDC 2007»
13 years 8 months ago
Improved scheduling in rings
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....
Dekel Tsur
COLT
2008
Springer
13 years 10 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
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...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 9 months ago
Average case analysis for batched disk scheduling and increasing subsequences
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. ...
Eitan Bachmat
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 9 months ago
Decision trees for entity identification: approximation algorithms and hardness results
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...
NN
2010
Springer
163views Neural Networks» more  NN 2010»
13 years 3 months ago
Approximating the stability region of a neural network with a general distribution of delays
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...
R. Jessop, S. A. Campbell