We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
The Behavior Action Simulation Platform (BASP) has been in existence since early 2000, when it was first applied to small-team reconnaissance scenarios for the United States Marin...