2084 search results - page 295 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
119
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
GIS
2006
ACM
14 years 10 months ago
2006
ACM
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
ALGORITHMICA
2005
14 years 9 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
ICALP
2010
Springer
14 years 12 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...