Sciweavers

195 search results - page 4 / 39
» Tractable Approximations to Robust Conic Optimization Proble...
Sort
View
FOCS
2005
IEEE
14 years 20 days ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
MIA
2010
170views more  MIA 2010»
13 years 1 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
UAI
2000
13 years 8 months ago
Approximately Optimal Monitoring of Plan Preconditions
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
Craig Boutilier
MP
2008
99views more  MP 2008»
13 years 7 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph