Sciweavers

1449 search results - page 182 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CEC
2005
IEEE
15 years 12 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
EUROCAST
2005
Springer
84views Hardware» more  EUROCAST 2005»
15 years 12 months ago
A Tractable Subclass of Fuzzy Constraint Networks
The Fuzzy Constraint Networks model, a generalization of the Disjunctive Temporal Fuzzy Constraint Networks, is a framework that allows representing and reasoning with fuzzy qualit...
Alfonso Bosch, Francisco Guil, Roque Marín
SPIRE
2001
Springer
15 years 10 months ago
Exact Distribution of Deletion Sizes for Unavoidable Strings
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
Christine E. Heitsch
BIRTHDAY
1999
Springer
15 years 10 months ago
Thompson Languages
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
Dora Giammarresi, Jean-Luc Ponty, Derick Wood
ICML
2007
IEEE
16 years 7 months ago
Solving multiclass support vector machines with LaRank
Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optim...
Antoine Bordes, Jason Weston, Léon Bottou, ...