1209 search results - page 137 / 242 » Universal Algebra and Computer Science |
119
click to vote
RTA
2009
Springer
15 years 10 months ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
134
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
119
Voted
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
120
click to vote
GG
2004
Springer
15 years 8 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
180
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...