Sciweavers

2031 search results - page 56 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
JMLR
2012
11 years 10 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
SIGPRO
2010
73views more  SIGPRO 2010»
13 years 6 months ago
Continuous-time and continuous-discrete-time unscented Rauch-Tung-Striebel smoothers
This article considers the application of the unscented transformation to approximate fixed-interval optimal smoothing of continuous-time non-linear stochastic systems. The propo...
Simo Särkkä
MSOM
2008
103views more  MSOM 2008»
13 years 7 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
AAIM
2009
Springer
137views Algorithms» more  AAIM 2009»
14 years 2 months ago
On Approximating an Implicit Cover Problem in Biology
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...
CP
2010
Springer
13 years 6 months ago
An Empirical Study of Optimization for Maximizing Diffusion in Networks
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gom...