Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
—In this paper, we propose two robust precoder designs for multiple-input multiple-output (MIMO) broadcast channels with imperfect channel state information (CSI). First, we cons...
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...