5329 search results - page 63 / 1066 » The Weighted Majority Algorithm |
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...