Sciweavers

2503 search results - page 399 / 501
» A study of 3-arc graphs
Sort
View
CSR
2009
Springer
13 years 11 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
13 years 10 months ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
13 years 10 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
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 10 months ago
The Naming Game in Social Networks: Community Formation and Consensus Engineering
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
IJRR
2006
119views more  IJRR 2006»
13 years 10 months ago
Predicting the Performance of Cooperative Simultaneous Localization and Mapping (C-SLAM)
In this paper we study the time evolution of the position estimates' covariance in Cooperative Simultaneous Localization and Mapping (C-SLAM), and obtain analytical upper boun...
Anastasios I. Mourikis, Stergios I. Roumeliotis