909 search results - page 96 / 182 » The Economics of Large-Memory Computations |
127
click to vote
ATAL
2010
Springer
15 years 1 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...
121
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
127
click to vote
GRID
2007
Springer
15 years 18 days ago
2007
Springer
The GEMSS project has developed a service-oriented Grid that supports the provision of medical simulation services by service providers to clients such as hospitals. We outline the...
111
Voted
JACM
2007
15 years 16 days ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
120
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...