Exploiting structure of chance constrained programs via submodularity
Related publications (91)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We consider the backlight calculation of local dimming as an optimization problem. The luminance produced by many LEDs at each pixel considered is calculated which should cover the gray value of each pixel. while the sum of LED currents is to be minimized. ...
The process industries are characterized by a large number of continuously operating plants, for which optimal operation is of economic importance. However, optimal operation is particularly difficult to achieve when the process model used in the optimizat ...
We present an effective method to optimize over the parameters of an image patch descriptor to obtain one that is computationally more efficient while maintaining a high recognition rate. We formulate the optimization problem in a multi-objective manner, w ...
This paper addresses the problem of dense disparity estimation in networks of omnidirectional cameras. We propose to map omnidirectional images on the 2-sphere, and we perform disparity estimation directly on the sphere in order to preserve the geometry of ...
Recently we have proposed a new image device called the gigavision camera. The main feature of this camera is that the pixels have a binary response. The response function of a gigavision sensor is non-linear and similar to a logarithmic function, which ma ...
In this paper the problem of dynamic manipulation of active objects by throwing is studied. Here active object means a multi-body object that can actively move its body parts. The prime reason for selecting this problem is existence of conceptual analogy b ...
The global solution of bilevel dynamic optimization problems is discussed. An overview of a deterministic algorithm for bilevel programs with nonconvex functions participating is given, followed by a summary of deterministic algorithms for the global solut ...
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes which has a direct impact on the lifetime of such a display. Modeling the proble ...
In the context of dynamic optimization, plant variations necessitate adaptation of the input profiles in order to guarantee both feasible and optimal operation. For those problems having path constraints, two sets of directions can be distinguished in the ...
Applications in software verification and interactive theorem proving often involve reasoning about sets of objects. Cardinality constraints on such collections also arise in these scenarios. Multisets arise for analogous reasons as sets: abstracting the c ...