256 search results - page 25 / 52 » A New Synchronous Lower Bound for Set Agreement |
117
click to vote
DAC
2004
ACM
16 years 22 days ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
SIROCCO
2007
15 years 1 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
125
click to vote
ESORICS
2010
Springer
15 years 26 days ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
135
click to vote
JMLR
2012
13 years 2 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
109
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...