192 search results - page 26 / 39 » Complexity Bounds for Regular Games |
IJFCS
2008
13 years 8 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
SIGECOM
2006
ACM
14 years 2 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...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
CCIA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we introduce an agent architecture for joint action negotiation among several agents in complex environments and with negotiation time bounds. The architect...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...