Sciweavers

403 search results - page 58 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
PODS
1999
ACM
121views Database» more  PODS 1999»
14 years 2 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
CP
2000
Springer
14 years 2 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
PVM
1999
Springer
14 years 2 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
FSTTCS
2008
Springer
13 years 11 months ago
Solvency Games
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...
Noam Berger, Nevin Kapur, Leonard J. Schulman, Vij...
ICASSP
2010
IEEE
13 years 10 months ago
Energy efficient lossy transmission over sensor networks with feedback
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
Aman Jain, Deniz Gündüz, Sanjeev R. Kulk...