425 search results - page 7 / 85 » On the additive constant of the k-server Work Function Algor... |
108
click to vote
DAM
2006
15 years 3 months ago
2006
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
131
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
176
click to vote
EUROCOLT
1999
Springer
15 years 7 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
147
click to vote
PPSN
1992
Springer
15 years 7 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
113
click to vote
ML
1998
ACM
15 years 3 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...