650 search results - page 95 / 130 » On Coalgebras over Algebras |
FUIN
2008
13 years 9 months ago
2008
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
ENTCS
2007
13 years 8 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
FCSC
2007
13 years 8 months ago
2007
The aim of mathematics mechanization is to develop symbolic algorithms for manipulating mathematical objects, proving and discovering theorems in a mechanical way. This paper gives...
FFA
2007
13 years 8 months ago
2007
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...