Sciweavers

2750 search results - page 133 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
CEC
2005
IEEE
15 years 8 months ago
Evolving autonomous agent control in the Xpilot environment
Abstract- Interactive combat games are useful as testbeds for learning systems employing evolutionary computation. Of particular value are games that can be modified to accommodate...
Gary B. Parker, Matt Parker, Steven D. Johnson
WOA
2001
15 years 7 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu
IJCAI
1989
15 years 7 months ago
Generating Better Decision Trees
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
Steven W. Norton
CORR
2012
Springer
216views Education» more  CORR 2012»
14 years 2 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran