1698 search results - page 21 / 340 » Growing Complex Games |
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
99
Voted
NETGAMES
2006
ACM
15 years 3 months ago
2006
ACM
Massive Multiplayer Online Games with their virtual gaming worlds grow in user numbers as well as in the size of the virtual worlds. With this growth comes a significant increase...
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the casefeature matrix. We pr...
123
click to vote
CVIU
2011
14 years 1 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
103
click to vote
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
The increasing popularity of persistent worlds and the predicted rise of pervasive gaming, both having a strong inherent potential for role-playing, stress a classical challenge o...