102 search results - page 17 / 21 » On Acyclicity of Games with Cycles |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
IEEESCC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
CG
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
MSS
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract We study the structure of unstable local effectivity functions defined for n players and p alternatives. A stability index based on the notion of cycle is introduced. In t...
AAAI
2010
13 years 8 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...