192 search results - page 29 / 39 » Complexity Bounds for Regular Games |
ECAI
2006
Springer
14 years 7 days ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
AIPS
2010
13 years 11 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
CGI
2004
IEEE
14 years 9 days ago
2004
IEEE
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
ECCC
2010
13 years 7 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
JMLR
2010
13 years 3 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...