Sciweavers

323 search results - page 23 / 65
» Dualizability and graph algebras
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
ECHT
1992
13 years 11 months ago
Gram: A Graph Data Model and Query Language
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
Bernd Amann, Michel Scholl
CSR
2009
Springer
13 years 8 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
FSTTCS
2008
Springer
13 years 8 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal