102 search results - page 4 / 21 » On Acyclicity of Games with Cycles |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...
RSA
2006
13 years 7 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
ENDM
2007
13 years 7 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...