4544 search results - page 347 / 909 » Reinforcement Learning with Time |
271
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
One of the most challenging aspects of managing a very large data warehouse is identifying how queries will behave before they start executing. Yet knowing their performance charac...
131
click to vote
EPIA
2003
Springer
15 years 9 months ago
2003
Springer
Most of supervised learning algorithms assume the stability of the target concept over time. Nevertheless in many real-user modeling systems, where the data is collected over an ex...
142
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
166
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
126
click to vote
FOCS
1994
IEEE
15 years 8 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...