Sciweavers

3088 search results - page 34 / 618
» Online Passive-Aggressive Algorithms
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 9 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
SODA
1993
ACM
85views Algorithms» more  SODA 1993»
13 years 10 months ago
On Traversing Layered Graphs On-line
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
H. Ramesh
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
13 years 10 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
14 years 9 months ago
Online server allocation in a server farm via benefit task systems
T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, B...
SIGIR
2011
ACM
12 years 11 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...