2925 search results - page 24 / 585 » Information Complexity of Online Problems |
118
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
195
Voted
ICAART
2010
INSTICC
15 years 11 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
135
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have p...
211
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
133
click to vote
ALT
2006
Springer
15 years 5 months ago
2006
Springer
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...