Sciweavers

5329 search results - page 862 / 1066
» The Weighted Majority Algorithm
Sort
View
COLT
2007
Springer
15 years 10 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 10 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, ...
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 10 months ago
Reducing the number of transistors in digital circuits using gate-level evolutionary design
This paper shows that the evolutionary design of digital circuits which is conducted at the gate level is able to produce human-competitive circuits at the transistor level. In ad...
Zbysek Gajda, Lukás Sekanina
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 10 months ago
Modeling XCS in class imbalances: population size and parameter settings
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
Albert Orriols-Puig, David E. Goldberg, Kumara Sas...
GECCO
2007
Springer
198views Optimization» more  GECCO 2007»
15 years 10 months ago
On the design of optimisers for surface reconstruction
In many industrial applications the need for an efficient and high-quality reconstruction of free-form surfaces does exist. Surface Reconstruction – the generation of CAD models...
Tobias Wagner, Thomas Michelitsch, Alexei Sacharow