12257 search results - page 2233 / 2452 » Analysis of Algorithms |
128
Voted
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
160
Voted
JMLR
2010
14 years 10 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
159
Voted
MOC
2010
14 years 10 months ago
2010
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...
99
Voted
SIAMMAX
2010
14 years 10 months ago
2010
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
144
Voted
SIGMETRICS
2010
ACM
14 years 10 months ago
2010
ACM
This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary al...