74 search results - page 3 / 15 » A Graphical Representation for Games in Partition Function F... |
ATAL
2010
Springer
13 years 7 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...
DATE
2005
IEEE
13 years 12 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
ICMCS
2007
IEEE
14 years 17 days ago
2007
IEEE
Computer graphics generated by advanced rendering software come to appear so photorealistic that it has become difficult for people to visually differentiate them from photographi...
SIGGRAPH
2000
ACM
13 years 10 months ago
2000
ACM
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...