5329 search results - page 327 / 1066 » The Weighted Majority Algorithm |
170
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
174
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
207
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
180
click to vote
ACL
2008
15 years 8 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
156
click to vote
ORL
2006
15 years 6 months ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...