Sciweavers

1997 search results - page 262 / 400
» On the convergence of Hill's method
Sort
View
CEC
2011
IEEE
14 years 1 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson
BMCBI
2006
146views more  BMCBI 2006»
15 years 1 months ago
Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influen...
Michael Meissner, Michael Schmuker, Gisbert Schnei...
141
Voted
ECCV
2008
Springer
15 years 12 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
SENSYS
2003
ACM
15 years 6 months ago
Anchor-free distributed localization in sensor networks
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 3 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...