14386 search results - page 2542 / 2878 » The Chinese Generals Problem |
175
click to vote
SIGMETRICS
2011
ACM
14 years 9 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
203
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
209
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
197
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
194
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...