Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
11 years 9 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
12 years 2 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»
12 years 4 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»
12 years 4 months 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
12 years 4 months 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
books