Sciweavers

2814 search results - page 44 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
CIKM
2008
Springer
13 years 12 months ago
Managing collaborative feedback information for distributed retrieval
Despite the many research efforts invested recently in peerto-peer search engines, none of the proposed system has reached the level of quality and efficiency of their centralized...
Pascal Felber, Toan Luu, Martin Rajman, Etienne Ri...
NIPS
2008
13 years 11 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
ACTA
2010
91views more  ACTA 2010»
13 years 4 months ago
A theoretical comparison of LRU and LRU-K
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S...
NIPS
2008
13 years 11 months ago
A Scalable Hierarchical Distributed Language Model
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
Andriy Mnih, Geoffrey E. Hinton
SAC
2009
ACM
14 years 4 months ago
Response time analysis of software transactional memory-based distributed real-time systems
We consider distributed real-time systems where concurrency control is managed using software transactional memory. For such a method we propose an algorithm to compute an upper b...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...