AUTOMATICA
2008
13 years 5 months ago
2008
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
LPNMR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
AAIM
2009
Springer
13 years 11 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...