644 search results - page 9 / 129 » Real Algebraic Numbers: Complexity Analysis and Experimentat... |
MST
1998
13 years 7 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
CONPAR
1992
13 years 11 months ago
1992
A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that st...
ENTCS
2006
13 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
SRDS
2006
IEEE
14 years 1 months ago
2006
IEEE
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...