In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probabil...
Alexandre Graell i Amat, Fredrik Brannstrom, Lars ...
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
We approach the problem of computational crystal structure prediction, implementing an evolutionary algorithm--USPEX (Universal Structure Predictor: Evolutionary Xtallography). St...