Sciweavers

3096 search results - page 140 / 620
» The Generalized FITC Approximation
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 2 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
GECCO
2004
Springer
14 years 2 months ago
Validating a Model of Colon Colouration Using an Evolution Strategy with Adaptive Approximations
The colour of colon tissue, which depends on the tissue structure, its optical properties, and the quantities of the pigments present in it, can be predicted by a physics-based mod...
Dzena Hidovic, Jonathan E. Rowe
SC
2003
ACM
14 years 2 months ago
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
Kai Wang, Jun Zhang, Chi Shen
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 1 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...