694 search results - page 63 / 139 » Open Graphs and Computational Reasoning |
AAAI
2007
14 years 16 days ago
2007
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
ATAL
2010
Springer
13 years 11 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...
SIGECOM
2006
ACM
14 years 4 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
WG
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
FLAIRS
2007
14 years 16 days ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...