5608 search results - page 720 / 1122 » On the Theory of Matchgate Computations |
192
click to vote
SIGGRAPH
1993
ACM
15 years 11 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
146
Voted
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
183
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
220
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
190
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...