Sciweavers

12257 search results - page 493 / 2452
» Analysis of Algorithms
Sort
View
GECCO
2010
Springer
206views Optimization» more  GECCO 2010»
15 years 8 months ago
Development of efficient particle swarm optimizers by using concepts from evolutionary algorithms
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...
Kalyanmoy Deb, Nikhil Padhye
MOBIHOC
2008
ACM
16 years 4 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 5 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
ICCAD
2006
IEEE
107views Hardware» more  ICCAD 2006»
16 years 2 months ago
Current path analysis for electrostatic discharge protection
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 11 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel