Sciweavers

134 search results - page 24 / 27
» Finiteness Conditions for Strictness Analysis
Sort
View
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
13 years 8 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
13 years 8 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
JIIS
2008
89views more  JIIS 2008»
13 years 8 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
JMLR
2006
132views more  JMLR 2006»
13 years 8 months ago
Accurate Error Bounds for the Eigenvalues of the Kernel Matrix
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenva...
Mikio L. Braun
SOCA
2008
IEEE
13 years 8 months ago
Specification of realizable service conversations using collaboration diagrams
Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computi...
Tevfik Bultan, Xiang Fu