Sciweavers

23 search results - page 4 / 5
» Learning Inadmissible Heuristics During Search
Sort
View
GPEM
2002
95views more  GPEM 2002»
13 years 6 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith
CPAIOR
2007
Springer
14 years 13 days ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
ESANN
2008
13 years 7 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
AMEC
2004
Springer
13 years 11 months ago
Bidding for Customer Orders in TAC SCM
Abstract. Supply chains are a current, challenging problem for agentbased electronic commerce. Motivated by the Trading Agent Competition Supply Chain Management (TAC SCM) scenario...
David Pardoe, Peter Stone
ML
2002
ACM
123views Machine Learning» more  ML 2002»
13 years 6 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein