356 search results - page 20 / 72 » Revisiting the Paxos Algorithm |
MST
2010
13 years 2 months 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...
TIT
2010
13 years 2 months 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 ...
TSP
2010
13 years 2 months 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. ...
FOSSACS
2009
Springer
14 years 2 months 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...
COMPGEOM
1995
ACM
13 years 11 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...