Sciweavers

2403 search results - page 142 / 481
» Optimal Randomized RANSAC
Sort
View
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
15 years 4 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
162
Voted
TJS
2002
160views more  TJS 2002»
15 years 3 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CEC
2010
IEEE
15 years 2 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
EOR
2007
101views more  EOR 2007»
15 years 3 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme