The following pages link to Scott Sanner (Q646496):
Displayed 12 items.
- Efficient solutions to factored MDPs with imprecise transition probabilities (Q646498) (← links)
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- Real-time dynamic programming for Markov decision processes with imprecise probabilities (Q901046) (← links)
- Symbolic bucket elimination for piecewise continuous constrained optimization (Q1626792) (← links)
- Arbitrary conditional inference in variational autoencoders via fast prior network training (Q2102323) (← links)
- Metric hybrid factored planning in nonlinear domains with constraint generation (Q2327279) (← links)
- Scalable Planning with Deep Neural Network Learned Transition Models (Q3300670) (← links)
- (Q5740455) (← links)
- A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination (Q6057248) (← links)
- Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression (Q6080967) (← links)