Sciweavers

849 search results - page 39 / 170
» Search allocation game
Sort
View
SIGIR
2011
ACM
14 years 15 days ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
CP
2009
Springer
15 years 10 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
AAAI
2006
14 years 11 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
CG
2008
Springer
14 years 11 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
DAM
1999
90views more  DAM 1999»
14 years 9 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin