Sciweavers

3571 search results - page 34 / 715
» On the Power of Imperfect Information
Sort
View
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
AI
2002
Springer
14 years 9 months ago
Relaxed Unification - Proposal
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...
Tony Abou-Assaleh, Nick Cercone
WWW
2008
ACM
15 years 10 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
OTM
2005
Springer
15 years 3 months ago
Modelling Context Information with ORM
Context-aware applications rely on implicit forms of input, such as sensor-derived data, in order to reduce the need for explicit input from users. They are especially relevant for...
Karen Henricksen, Jadwiga Indulska, Ted McFadden
SIGIR
2004
ACM
15 years 3 months ago
Retrieval evaluation with incomplete information
This paper examines whether the Cranfield evaluation methodology is robust to gross violations of the completeness assumption (i.e., the assumption that all relevant documents wi...
Chris Buckley, Ellen M. Voorhees