From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We consider the problem of a sensor network tracking a moving target that exhibits a Markov model of mobility. The sensor nodes have adjustable power levels and the precision of the measurement of the target location depends on both the relative distance f ...
Optimization arises naturally when process performance needs improvement. This is often the case in industry because of competition – the product has to be proposed at the lowest possible cost. From the point of view of control, optimization consists in de ...
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (mpLPs) with a parameter in the cost, or equivalently the right-hand side of the constraints, and solved explicitly offline. Degenera ...
We provide necessary optimality conditions for a general class of discounted infinite-horizon dynamic optimization problems. As part of the resulting maximum principle we obtain explicit bounds on the adjoint variable, stronger than the transversality cond ...
In this paper, we investigate the effect of temporal context for speech/non-speech detection (SND). It is shown that even a simple feature such as full-band energy, when employed with a large-enough context, shows promise for further investigation. Experim ...
For the optimization of dynamic systems, it is customary to use measurements to combat the effect of uncertainty. In this context, an approach that consists of tracking the necessary conditions of optimality is gaining in popularity. The approach relies st ...
Previously, G. Cornuejols and M. Dawande (1998) proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branch-and-bound. They offered these market split ...
This paper presents a decomposition approach for a quite general class of mixed-integer dynamic optimization problems that is capable of guaranteeing a global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case stud ...
Due to the steady tendency to propose highly customized products and to respond to volatile (i.e random) demands, Flexible Manufacturing Systems (FMS) are now present in most shopfloors. In this thesis, flexibility in a FMS is understood as the ability of ...
In this paper, we investigate the effect of temporal context for speech/non-speech detection (SND). It is shown that even a simple feature such as full-band energy, when employed with a large-enough context, shows promise for further investigation. Experim ...
