1175 search results - page 72 / 235 » Abstract computability and algebraic specification |
CIE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precis...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...