Sciweavers

42230 search results - page 388 / 8446
» Algorithms and Complexity Results for
Sort
View
CORR
2012
Springer
216views Education» more  CORR 2012»
14 years 2 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 11 days ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
CJ
2008
90views more  CJ 2008»
15 years 7 months ago
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A....
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 7 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
172
Voted
EOR
2008
84views more  EOR 2008»
15 years 6 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...