102291 search results - page 20377 / 20459 » Computability in Computational Geometry |
132
click to vote
SIAMCO
2010
14 years 6 months ago
2010
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
114
click to vote
SIAMCOMP
2010
14 years 6 months ago
2010
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
124
click to vote
SIAMIS
2010
14 years 6 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
SIAMJO
2010
14 years 6 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
108
click to vote
SIAMJO
2010
14 years 6 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...