Results 1  10
of
322
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 807 (4 self)
 Add to MetaCart
. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems
Pizza into Java: Translating theory into practice
 In Proc. 24th ACM Symposium on Principles of Programming Languages
, 1997
"... Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because ..."
Abstract

Cited by 336 (15 self)
 Add to MetaCart
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because
Combinatorial Commutative Algebra
, 2004
"... The last decade has seen a number of exciting developments at the intersection of commutative algebra with combinatorics. New methods have evolved out of an influx of ideas from such diverse areas as polyhedral geometry, theoretical physics, representation theory, homological algebra, symplectic geo ..."
Abstract

Cited by 125 (5 self)
 Add to MetaCart
geometry, graph theory, integer programming, symbolic computation, and statistics. The purpose of this volume is to provide a selfcontained introduction to some of the resulting combinatorial techniques for dealing with polynomial rings, semigroup rings, and determinantal rings. Our exposition mainly
On Infinite Transition Graphs Having A Decidable Monadic Theory
 Lecture Notes in Computer Science
, 1996
"... We define a family of graphs whose monadic theory is linearly reducible to the monadic theory S2S of the complete deterministic binary trees. This family contains strictly the contextfree graphs investigated by Muller and Schupp, and also the equational graphs defined by Courcelle. Using words for ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
We define a family of graphs whose monadic theory is linearly reducible to the monadic theory S2S of the complete deterministic binary trees. This family contains strictly the contextfree graphs investigated by Muller and Schupp, and also the equational graphs defined by Courcelle. Using words
Graphs, groupoids and CuntzKrieger algebras
, 1996
"... We associate to each locally finite directed graph G two locally compact groupoids G and G(?). The unit space of G is the space of onesided infinite paths in G, and G(?) is the reduction of G to the space of paths emanating from a distinguished vertex ?. We show that under certain conditions the ..."
Abstract

Cited by 47 (17 self)
 Add to MetaCart
the ideal structure of these groupoid C algebras using the general theory of Renault, and calculate their Ktheory. 1 Introduction Over the past fifteen years many C algebras and classes of C algebras have been given groupoid models. Here we consider locally finite directed graphs, which may have
Algebraic Tools for the Performance Evaluation of Discrete Event Systems
 IEEE Proceedings: Special issue on Discrete Event Systems
, 1989
"... In this paper, it is shown that a certain class of Petri nets called event graphs can be represented as linear "timeinvariant" finitedimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developped in a manner which is very ana ..."
Abstract

Cited by 96 (6 self)
 Add to MetaCart
In this paper, it is shown that a certain class of Petri nets called event graphs can be represented as linear "timeinvariant" finitedimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developped in a manner which is very
The Algebra of 3Graphs
 Proc. Steklov Inst. Math. 221
, 1998
"... We introduce and study the structure of an algebra in the linear space spanned by all regular 3valent graphs with a prescribed order of edges at every vertex, modulo certain relations. The role of this object in various areas of low dimensional topology is discussed. 0 Introduction Regular gra ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We introduce and study the structure of an algebra in the linear space spanned by all regular 3valent graphs with a prescribed order of edges at every vertex, modulo certain relations. The role of this object in various areas of low dimensional topology is discussed. 0 Introduction Regular
Algebraic matroids with graph symmetry
, 2013
"... This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a) algebraic matroids, we expose cryptomorphisms making them acc ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
accessible to techniques from commutative algebra. This allows us to introduce for each circuit in an algebraic matroid an invariant called circuit polynomial, generalizing the minimal polynomial in classical Galois theory, and studying the matroid structure with multivariate methods. For (b) matroids
Combinatorial Hopf algebras in quantum field theory I
 Reviews of Mathematical Physics
, 2005
"... This manuscript collects and expands for the most part a series of lectures on the interface between combinatorial Hopf algebra theory (CHAT) and renormalization theory, delivered by the secondnamed author in the framework of the joint mathematical physics seminar of the Universités d’Artois and Li ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
’Artois and Lille 1, from late January till midFebruary 2003. The plan is as follows: Section 1 is the introduction, and Section 2 contains an elementary invitation to the subject. Sections 3–7 are devoted to the basics of Hopf algebra theory and examples, in ascending level of complexity. Section 8 contains a
ON ALGEBRAIC GRAPH THEORY AND THE DYNAMICS OF INNOVATION NETWORKS
"... Abstract. We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [37]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi) star, varying within a well define ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [37]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi) star, varying within a well
Results 1  10
of
322