Sciweavers

148 search results - page 15 / 30
» An Algebraic Theory of Graph Reduction
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
ESORICS
2008
Springer
13 years 9 months ago
State Space Reduction in the Maude-NRL Protocol Analyzer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
Santiago Escobar, Catherine Meadows, José M...
TSMC
2010
13 years 2 months ago
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
Wenwu Yu, Guanrong Chen, Ming Cao, Jürgen Kur...
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard