Sciweavers

1537 search results - page 63 / 308
» On sets not belonging to algebras
Sort
View
ADBIS
2007
Springer
137views Database» more  ADBIS 2007»
14 years 1 months ago
An Object-Oriented Based Algebra for Ontologies and Their Instances
Nowadays, ontologies are used in a lot of diverse research fields. They provide with the capability to describe a huge set of information contents. Therefore, several approaches f...
Stéphane Jean, Yamine Aït Ameur, Guy P...
ISSAC
2004
Springer
94views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Algorithms for polynomial GCD computation over algebraic function fields
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
Mark van Hoeij, Michael B. Monagan
ENTCS
2008
100views more  ENTCS 2008»
13 years 7 months ago
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi
Hybrid Chi is a process algebra for the modeling and analysis of hybrid systems. It enables modular specification of hybrid systems by means of a large set of atomic statements an...
Jos C. M. Baeten, Dirk A. van Beek, Pieter J. L. C...
JAPLL
2007
78views more  JAPLL 2007»
13 years 7 months ago
Execution architectures for program algebra
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
Jan A. Bergstra, Alban Ponse
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
13 years 7 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres