281 search results - page 48 / 57 » The Complexity of Planar Counting Problems |
SIGECOM
2010
ACM
14 years 16 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
SEMWEB
2001
Springer
14 years 4 days ago
2001
Springer
Querying the Web today can be a frustrating activity because the results delivered by syntactically oriented search engines often do not match the intentions of the user. The DARP...
FPL
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
AAAI
2007
13 years 10 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
FGCS
2008
13 years 7 months ago
2008
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...