The interactive decision making (IDM) methods exploit the preference information from the decision maker during the optimization task to guide the search towards favourite solution...
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
Query performance prediction is aimed at predicting the retrieval effectiveness that a query will achieve with respect to a particular ranking model. In this paper, we study quer...
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...