779 search results - page 109 / 156 » Information-theoretic Competitive Learning |
GECCO
2000
Springer
14 years 13 days ago
2000
Springer
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control ...
FLAIRS
2007
13 years 11 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
ICAISC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Multigame playing agents are programs capable of autonomously learning to play new, previously unknown games. In this paper, we concentrate on the General Game Playing Co...
AAAI
2010
13 years 10 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
NIPS
2008
13 years 10 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...