„Algorithm quasi“
Suchergebnisse
512 Treffer
-
A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting
-
Quantum linear system algorithm for solving an ill-posed quasi-linear elliptic problem by preconditioning operator
-
Optimal Korobov Coefficients for Good Lattice Points in Quasi Monte Carlo Algorithms
-
An Efficient Randomized Quasi-Monte Carlo Algorithm for the Pareto Distribution
-
Quasi- Monte Carlo algorithms for solving linear algebraic equations
-
On global sensitivity analysis of quasi-Monte Carlo algorithms
-
A Physical-constraint-preserving Quasi-conservative Discontinuous Galerkin Method for Solving Six-equation Model of Compressible Two-phase Flows
-
An Efficient Quasi-Newton Method with Tensor Product Implementation for Solving Quasi-Linear Elliptic Equations and Systems
-
A family of descent spectral three-term conjugate gradient methods based on the quasi–Newton aspects with applications to nonnegative matrix factorization and image restoration
-
A quasi oppositional forensic based investigation algorithm for optimizing distributed generation placement and sizing in power distribution systems
-
Quasi-Newton interior point method for solving nonlinear system of equations with box constraints
-
Distributed Quasi-Newton Algorithm for Non-Randomly Stored Data
-
On the Study of the Chebyshev Property for the Families of Trigonometric Quasi-Polynomials via Generalized Derivation-Division Algorithm
-
Monte Carlo and Quasi-Monte Carlo Methods 2008
-
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
-
On a class of infinite M-matrices with an extended quasi-Toeplitz structure
-
A quasi affine transformation evolution algorithm with evolution matrix selection operation for parameter estimation of proton exchange membrane fuel cells
-
Robust external calibration of terrestrial laser scanner and digital camera for structural monitoring
-
The method of adjoint equations for solving the problem of quasi-geostrophic currents in a two-layer ocean periodic channel
-
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs