Sciweavers

5115 search results - page 142 / 1023
» On Randomized Lanczos Algorithms
Sort
View
VTC
2007
IEEE
107views Communications» more  VTC 2007»
16 years 19 days ago
Random Switched Beamforming for Uplink Wireless Sensor Networks
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
Mohammed Elmusrati, Vesa Hasu
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
16 years 16 days ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg
STACS
2005
Springer
15 years 12 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
FOCS
2003
IEEE
15 years 11 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...