Sciweavers

4911 search results - page 148 / 983
» Tree dependence analysis
Sort
View
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
15 years 1 months ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson
JMLR
2008
129views more  JMLR 2008»
15 years 1 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
COCOON
2009
Springer
15 years 7 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 1 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
TALG
2008
67views more  TALG 2008»
15 years 1 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan