356 search results - page 20 / 72 » Revisiting the Paxos Algorithm |
167
click to vote
MST
2010
15 years 20 days ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
151
click to vote
TIT
2010
15 years 19 days ago
2010
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
157
click to vote
TSP
2010
15 years 18 days ago
2010
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
214
click to vote
FOSSACS
2009
Springer
16 years 21 days ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
159
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...