Sciweavers

5153 search results - page 814 / 1031
» Introduction to Randomized Algorithms
Sort
View
IM
2007
15 years 3 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 3 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
ML
1998
ACM
101views Machine Learning» more  ML 1998»
15 years 3 months ago
Elevator Group Control Using Multiple Reinforcement Learning Agents
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
Robert H. Crites, Andrew G. Barto
JCSS
2010
91views more  JCSS 2010»
15 years 1 months ago
Content-dependent chunking for differential compression, the local maximum approach
When a file is to be transmitted from a sender to a recipient and when the latter already has a file somewhat similar to it, remote differential compression seeks to determine t...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
159
Voted
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 1 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo