✦ LIBER ✦

On Optimal Random Nets

✍ Scribed by Peter Mathé

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 320 KB
Volume: 9
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1993.1012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal random coding

✍ Charles S. Peskin 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

Randomness-optimal oblivious sampling

✍ David Zuckerman 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any ␣ ) 0, it Ž .Ž y 1 . Ž y 1 y 1 . uses 1 q ␣ m q log ␥ random bits to output ds poly ⑀ , log ␥ , m sample points Ä 4 m Ä 4 m w x w<Ž .

Optimal parallel processing of random ta

Optimal parallel processing of random task graphs

✍ Zhen Liu; Rhonda Righter 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 180 KB

We consider scheduling of tasks of parallel programs on multiprocessor systems where tasks have precedence relations and synchronization points. The task graph structures are random variables in the sense that successors to a task do not become known until the task is executed. Thus, as is often the

Optimal Absorption Probabilities for Ran

Optimal Absorption Probabilities for Random Walk Radiosity

✍ Mateu Sbert 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

In this paper we study random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and the finite path length one, can be

Approximate counting via random optimiza

Approximate counting via random optimization

✍ Alexander Barvinok 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

Let F F be a family of subsets of 1, . . . , n . We propose a simple randomized n algorithm to estimate the cardinality of F F from the maximum weight of a subset X g F F in n n Ä 4 a random weighting of 1, . . . , n . The examples include enumeration of perfect matchings in graphs, bases in matroid

On possibilistic timed safe Petri nets

✍ Sandra Sandri; Janétte Cardoso 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

The first goal of this work is to extend a model of Timed Safe Petri Nets to allow the treatment of preference between transitions. In the proposed Possibilistic Timed Safe Petri Net, we attach a duration to each transition, which can be precise, imprecise, or fuzzy, accounting for the maximal amoun