Sciweavers

5138 search results - page 33 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 6 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
CCE
2006
14 years 11 months ago
Design of heat exchanger networks using randomized algorithm
A randomized algorithm with stream splitting for design of heat exchanger networks is presented in this work. The algorithm has provisions for splitting any one of the process str...
Ankur Pariyani, Abhigyan Gupta, Pallab Ghosh
NIPS
2003
15 years 1 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
CN
2007
148views more  CN 2007»
14 years 11 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...