Sciweavers

681 search results - page 30 / 137
» Searching with expectations
Sort
View
96
Voted
AAAI
2006
15 years 1 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian
INFORMS
2008
62views more  INFORMS 2008»
14 years 11 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu
SIGIR
2006
ACM
15 years 5 months ago
Learning user interaction models for predicting web search result preferences
Evaluating user preferences of web search results is crucial for search engine development, deployment, and maintenance. We present a real-world study of modeling the behavior of ...
Eugene Agichtein, Eric Brill, Susan T. Dumais, Rob...
FOCI
2007
IEEE
15 years 6 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
73
Voted
DEXAW
2010
IEEE
150views Database» more  DEXAW 2010»
15 years 26 days ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Matthias Hagen, Benno Stein