Sciweavers

269 search results - page 12 / 54
» Optimal Randomized Algorithms for Local Sorting and Set-Maxi...
Sort
View
FOCI
2007
IEEE
14 years 1 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
IPPS
1997
IEEE
13 years 11 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
IDA
1999
Springer
13 years 11 months ago
Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
Mayer Aladjem
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
14 years 1 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong
SECON
2008
IEEE
14 years 1 months ago
On Distributed Optimization Using Peer-to-Peer Communications in Wireless Sensor Networks
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
Björn Johansson, Cesare M. Carretti, Mikael J...