Sciweavers

4013 search results - page 192 / 803
» computer 2002
Sort
View
MOC
2002
98views more  MOC 2002»
15 years 3 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
MOC
2002
185views more  MOC 2002»
15 years 3 months ago
Repunit R49081 is a probable prime
The Repunit R49081 = (1049081 - 1)/9 is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included. Rep...
Harvey Dubner
MOC
2002
87views more  MOC 2002»
15 years 3 months ago
On the resolution of relative Thue equations
An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeratio...
István Gaál, Michael Pohst
TCS
2002
15 years 3 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
CLUSTER
2002
IEEE
15 years 9 months ago
Cluster Based Hybrid Hash Join: Analysis and Evaluation
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
Erich Schikuta, Peter Kirkovits