Dimensionality Reduction in Dynamic Optimization under Uncertainty
Related publications (153)
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 unicast equation based rate control, where a source estimates the loss event ratio p, and, primarily at loss events, adjusts its sending rate to f(p). Function f is assumed to represent the loss-throughput relation that TCP would experience. Wh ...
We consider unicast equation based rate control, where a source estimates the loss event ratio p, and, primarily at loss events, adjusts its sending rate to f(p). Function f is assumed to represent the loss-throughput relation that TCP would experience. Wh ...
We identify a class of term structure models possessing a generalized affine-structure that significantly extends the class studied by Duffie, Pan, and Singleton (2000) and Chacko and Das (2002). This class of models, which includes both infinite-state-var ...
This paper presents a decomposition approach for a quite general class of mixed- integer dynamic optimization problems that is capable of guaranteeing the global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case s ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
We propose a very fast and accurate algorithm for pricing swaptions when the underlying term structure dynamics are affine. The efficiency of the algorithm stems from the fact that the moments of the underlying asset (i.e., a coupon bond) possess simple cl ...
The probability distribution P(k) of the sizes k of critical trees ( branching ratio m = 1) is well known to show a power law behavior k(-3/2). Such behavior corresponds to the mean-field approximation for many critical and self-organized critical phenomen ...
This paper focuses on the statistical analysis of an adaptive real-time feedback scheduling technique based on imprecise computation. We consider two-version tasks made of a mandatory and an optional part to be scheduled according to a feedback control rat ...
We consider unicast equation-based rate con-trol, where, at some points in time, a sender adjusts its rate to f(p,r), where p is an on-line estimate of the loss-event rate observed by this source, r of the average round-trip time, and f is a TCP throughput ...