Sciweavers

2126 search results - page 116 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
ASIACRYPT
2003
Springer
15 years 10 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 10 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 8 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
CEC
2010
IEEE
15 years 1 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...