Sciweavers

1578 search results - page 121 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
ECML
2006
Springer
15 years 1 months ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
ICES
1998
Springer
131views Hardware» more  ICES 1998»
15 years 2 months ago
Aspects of Digital Evolution: Geometry and Learning
In this paper we present a new chromosome representation for evolving digital circuits. The representation is based very closely on the chip architecture of the Xilinx 6216 FPGA. W...
Julian F. Miller, Peter Thomson
GECCO
2004
Springer
15 years 3 months ago
On the Choice of the Population Size
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Tobias Storch
AC
2003
Springer
15 years 3 months ago
Concentration Inequalities
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it pos...
Stéphane Boucheron, Gábor Lugosi, Ol...