Sciweavers

3422 search results - page 71 / 685
» Random Subset Optimization
Sort
View
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 8 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
IPPS
1998
IEEE
15 years 8 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
CEC
2008
IEEE
15 years 11 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
ICC
2007
IEEE
15 years 10 months ago
Opportunistic Power Allocation for Random Beamforming in MISO Broadcast Channels
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
Edward W. Jang, Hyukjoon Kwon, John M. Cioffi
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 4 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li