Sciweavers

849 search results - page 60 / 170
» Search allocation game
Sort
View
IJCAI
2001
14 years 11 months ago
Reinforcement Learning in Distributed Domains: Beyond Team Games
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
David Wolpert, Joseph Sill, Kagan Tumer
ICGA
2007
89views Optimization» more  ICGA 2007»
14 years 9 months ago
Playing the Right Atari
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
Tristan Cazenave
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 4 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
IAT
2010
IEEE
14 years 7 months ago
An Interaction-Oriented Model of Customer Behavior for the Simulation of Supermarkets
Abstract--Since several years, great distribution firms implement more and more complex layout and shelf allocation strategies, so as to force empirical know-how to combine with Ar...
Yoann Kubera, Philippe Mathieu, Sébastien P...
DCC
2002
IEEE
15 years 9 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr