Sciweavers

573 search results - page 55 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
14 years 13 days ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
SIAMAM
2008
131views more  SIAMAM 2008»
13 years 9 months ago
Asymptotic and Numerical Techniques for Resonances of Thin Photonic Structures
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...
J. Gopalakrishnan, S. Moskow, F. Santosa
PPSC
1993
13 years 10 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
IPM
2006
171views more  IPM 2006»
13 years 9 months ago
Automatic extraction of bilingual word pairs using inductive chain learning in various languages
In this paper, we propose a new learning method for extracting bilingual word pairs from parallel corpora in various languages. In cross-language information retrieval, the system...
Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
14 years 26 days ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama