Sciweavers

3495 search results - page 41 / 699
» On the random satisfiable process
Sort
View
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
14 years 2 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
CDC
2010
IEEE
140views Control Systems» more  CDC 2010»
13 years 5 months ago
On the observability of linear systems from random, compressive measurements
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
Michael B. Wakin, Borhan Molazem Sanandaji, Tyrone...
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
15 years 3 days ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...
SAC
2004
ACM
14 years 4 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley