1095 search results - page 150 / 219 » Algebraic Guide Generation |
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
VALUETOOLS
2006
ACM
14 years 2 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
TIME
2005
IEEE
14 years 2 months ago
2005
IEEE
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
CCA
2005
Springer
14 years 2 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
IFM
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We describe how CSP-OZ, an integrated formal method combining the process algebra CSP with the specification language Object-Z, can be linked to standard software engine...