11910 search results - page 143 / 2382 » Online Learning Algorithms |
128
Voted
ECCC
2006
15 years 2 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
115
click to vote
JAIR
2008
15 years 2 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
130
Voted
SODA
1993
ACM
15 years 3 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
125
Voted
CI
2010
15 years 2 months ago
2010
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line ca...
152
Voted
EC
2006
15 years 2 months ago
2006
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...