Sciweavers

2 search results - page 1 / 1
» PageRank Optimization in Polynomial Time by Stochastic Short...
Sort
View
ALT
2010
Springer
13 years 8 days ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 6 days ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain