Sciweavers

2853 search results - page 350 / 571
» On Coherence in Computer Algebra
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 4 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 4 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 11 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
AOSD
2012
ACM
14 years 10 hour ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
CONCUR
1992
Springer
15 years 8 months ago
The Duality of TIme and Information
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
Vaughan R. Pratt