Randomization in the two-parameter optimal stopping problem
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.
I present an introduction to some of the concepts within Bayesian networks to help a beginner become familiar with this field's theory. Bayesian networks are a combination of two different mathematical areas: graph theory and probability theory. So, I firs ...
The problem of determining whether a graph G contains a threshold subgraph containing at least h edges is shown to be NP-complete if h is part of the input as the problems of minimum threshold completion, weighted 2-threshold partition and weighted 2-thres ...
We find that the probabilistic bound on delay in the article by Goyal et al. in 1997 is incorrect. The problem originates from: 1) the difference between stationary and Palm probabilities and 2) treating the arrival counting process over some random time i ...
We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time inter ...
Register allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow [Chow84]. This paper describes the algorithm and the tec ...
Randomized stopping points form a convex set associated with the information structure that arises in the context of the optimal stopping problem for two-parameter processes. We study combinatorial properties of this structure when the underlying space is ...
The developments in EMC modelling permit to estimate the disturbances in different kinds of circuits and installations, to define a protection philosophy and to evaluate its efficiency. Using some examples of modelling, the paper discusses whether these po ...
In this thesis we investigate a number of problems related to 2-level polytopes, in particular regarding their combinatorial structure and extension complexity. 2-level polytopes have been introduced as a generalization of stable set polytopes of perfect g ...
Formation building and keeping among vehicles has been studied for many years, since 1987 with Reynolds' rules [1]. This paper presents a control algorithm, based on recent work in graph theory, able to reconfigure static formations of non-holonomic vehicl ...
