The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
What set of concepts and formalizations might one use to make a practically useful, theoretically rigorous theory of generally intelligent systems? We present a novel perspective m...
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
—A method to quantify the probabilistic controller taskload inherent to maintaining aircraft adherence to 4-D trajectories within flow corridors is presented. Taskload is here d...
Vlad Popescu, John-Paul Clarke, Karen M. Feigh, Er...