Sciweavers

3208 search results - page 319 / 642
» A Lower Bound for Primality
Sort
View
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
16 years 22 days ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
PODC
2006
ACM
16 years 21 days ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
CEC
2005
IEEE
16 years 11 days ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
FOCS
2005
IEEE
16 years 10 days ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
Subhash Khot, Assaf Naor
160
Voted
FOCS
2005
IEEE
16 years 10 days ago
The Parking Permit Problem
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
Adam Meyerson