55 search results - page 4 / 11 » Convergence Rates for Greedy Algorithms in Reduced Basis Met... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
SIAMIS
2010
13 years 2 months ago
2010
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
DCC
2010
IEEE
14 years 2 months ago
2010
IEEE
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...