Sciweavers

AUTOMATICA
2008
86views more  AUTOMATICA 2008»
13 years 5 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
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...
Chunkai Gao, Jorge Cortés, Francesco Bullo
LPNMR
2001
Springer
13 years 10 months ago
Multi-dimensional Dynamic Knowledge Representation
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...
João Alexandre Leite, José Jú...
AAIM
2008
Springer
96views Algorithms» more  AAIM 2008»
13 years 11 months ago
Minimum Leaf Out-Branching Problems
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...
Gregory Gutin, Igor Razgon, Eun Jung Kim
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
14 years 2 days ago
On Acyclicity of Games with Cycles
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...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
BIRTHDAY
2009
Springer
14 years 7 days ago
On Path Partitions and Colourings in Digraphs
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...
Irith Ben-Arroyo Hartman