28 search results - page 5 / 6 » Constraint satisfaction algorithms for graphical games |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
IUI
2004
ACM
13 years 10 months ago
2004
ACM
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
AI
2010
Springer
13 years 5 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...