2783 search results - page 436 / 557 » The Nature Of Near-Synonymic Relations |
126
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
105
click to vote
ECCC
2008
15 years 1 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
114
Voted
EJC
2008
15 years 1 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
121
click to vote
ENTCS
2008
15 years 1 months ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...