Sciweavers

849 search results - page 114 / 170
» Search allocation game
Sort
View
IJCAI
2001
13 years 11 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 4 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen
ICMLA
2003
13 years 11 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
TCIAIG
2010
13 years 5 months ago
Current Frontiers in Computer Go
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Sh...
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Optimal Error Protection of Progressively Compressed 3D Meshes
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
Shakeel Ahmad, Raouf Hamzaoui