1730 search results - page 306 / 346 » Algebra and Computation |
TAMC
2007
Springer
14 years 4 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
DATE
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
Soft errors are an increasingly serious problem for logic circuits. To estimate the effects of soft errors on such circuits, we develop a general computational framework based on ...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
ā The paper considers the problem of setting the dimensions of a system of constrained parallel robots to ensure that together they can position an end-effector in a speciļ¬ed s...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...