Sciweavers

829 search results - page 121 / 166
» Bandit Algorithms for Tree Search
Sort
View
CVPR
1998
IEEE
15 years 11 months ago
An Optimized Interaction Strategy for Bayesian Relevance Feedback
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...
WEBI
2005
Springer
15 years 3 months ago
Improving Web Clustering by Cluster Selection
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
CP
2007
Springer
15 years 3 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
AIRS
2006
Springer
15 years 1 months ago
Automatic Query Type Identification Based on Click Through Information
We report on a study that was undertaken to better identify users' goals behind web search queries by using click through data. Based on user logs which contain over 80 millio...
Yiqun Liu, Min Zhang, Liyun Ru, Shaoping Ma
JAIR
2011
123views more  JAIR 2011»
14 years 4 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...