2924 search results - page 387 / 585 » Lower Bounds in Distributed Computing |
128
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
145
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we present a novel method for efficient 3D model comparison. The method matches highly deformed models by comparing topological and geometric features. First, we pr...
119
click to vote
JACM
2011
14 years 11 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
121
Voted
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
163
click to vote
REX
1991
15 years 8 months ago
1991
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...