Sciweavers

230 search results - page 5 / 46
» XCS with computed prediction for the learning of Boolean fun...
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...
MFCS
2004
Springer
14 years 26 days ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
AAAI
1998
13 years 9 months ago
Learning Evaluation Functions for Global Optimization and Boolean Satisfiability
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems.STAGElearns an evaluation function which predicts the outcom...
Justin A. Boyan, Andrew W. Moore
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
13 years 11 months ago
Mixing independent classifiers
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
Jan Drugowitsch, Alwyn Barry
FOCS
1998
IEEE
13 years 11 months ago
On Learning Monotone Boolean Functions
Avrim Blum, Carl Burch, John Langford