Sciweavers

368 search results - page 66 / 74
» Improved Online Algorithms for the Sorting Buffer Problem
Sort
View
NIPS
1994
13 years 10 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
JMLR
2010
184views more  JMLR 2010»
13 years 3 months ago
Sequential Monte Carlo Samplers for Dirichlet Process Mixtures
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
Yener Ülker, Bilge Günsel, Ali Taylan Ce...
NETGAMES
2006
ACM
14 years 2 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
INFOCOM
2006
IEEE
14 years 2 months ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner