Sciweavers

906 search results - page 50 / 182
» Linking Theories of Concurrency
Sort
View
EWSN
2004
Springer
15 years 11 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
AAAI
1990
15 years 7 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
APSEC
2008
IEEE
16 years 18 days ago
Using Abstraction to Verify Arbitrary Temporal Properties
straction to Verify Arbitrary Temporal Properties Amir Pnueli New York University and Weizmann Institute of Sciences (Emeritus) Perspectives in Concurrency Theory, Chennai, 15 Dece...
Amir Pnueli
CAI
2007
Springer
16 years 9 days ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
SIAMIS
2008
124views more  SIAMIS 2008»
15 years 6 months ago
Area Distances of Convex Plane Curves and Improper Affine Spheres
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. Th...
Marcos Craizer, Moacyr Alvim, Ralph Teixeira