Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
Marco Falda, Francesca Rossi, Kristen Brent Venabl...
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...