Sciweavers

5580 search results - page 132 / 1116
» Randomized priority algorithms
Sort
View
CDES
2006
107views Hardware» more  CDES 2006»
14 years 11 months ago
An Algorithm for Yield Improvement via Local Positioning and Resizing
The ability to improve the yield of integrated circuits through layout modification has been recognized and several techniques for yield enhanced routing and compaction have been ...
Vazgen Karapetyan
GLOBECOM
2008
IEEE
15 years 4 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
JACM
2006
98views more  JACM 2006»
14 years 10 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
15 years 2 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros