Sciweavers

222 search results - page 27 / 45
» Heuristic Evaluation Functions for General Game Playing
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 11 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
HT
2009
ACM
13 years 5 months ago
Games with a purpose for social networking platforms
The online games market has matured in recent years. It is now a multi-billion dollar business with hundreds of millions players worldwide. At the same time, social networking pla...
Walter Rafelsberger, Arno Scharl
PODC
2004
ACM
14 years 1 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
CIKM
2006
Springer
13 years 11 months ago
Optimisation methods for ranking functions with multiple parameters
Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances ...
Michael J. Taylor, Hugo Zaragoza, Nick Craswell, S...
ATAL
2007
Springer
14 years 1 months ago
Empirical game-theoretic analysis of the TAC Supply Chain game
The TAC Supply Chain Management (TAC/SCM) game presents a challenging dynamic environment for autonomous decision-making in a salient application domain. Strategic interactions co...
Patrick R. Jordan, Christopher Kiekintveld, Michae...