output
19952026
most citedA Review of Uncertainty Quantification in Deep Learning: Techniques, Applications and Challenges

2.7k citations

researchers with a paper here
collaborating institutions
Showing 1995Show all

1 paper · 1 filter

cs.AI1995

OPUS: An Efficient Admissible Algorithm for Unordered Search

G. I. Webb

OPUS is a branch and bound search algorithm that enables efficient admissible search through spaces for which the order of search operator application is not significant. The algor…