Search Sciweavers | Sciweavers

18

QUESTA
2002

87views more QUESTA 2002»

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

13 years 8 months ago

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary ...

Iddo Eliazar, Gadi Fibich, Uri Yechiali

claim paper

Read More »

27

click to vote

EUROCRYPT
2007
Springer

123views Cryptology» more EUROCRYPT 2007»

Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability

14 years 26 days ago

Download www.iacr.org

Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...

Yi Deng, Dongdai Lin

claim paper

Read More »

24

click to vote

JAIR
2006

121views more JAIR 2006»

How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines

13 years 9 months ago

Download www.jair.org

We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...

Matthew J. Streeter, Stephen F. Smith

claim paper

Read More »

25

click to vote

IPCO
1996

89views Optimization» more IPCO 1996»

On Dependent Randomized Rounding Algorithms

13 years 10 months ago

Download web.mit.edu

In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...

Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra

claim paper

Read More »

19

click to vote

IPCO
2010

143views Optimization» more IPCO 2010»

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm

13 years 10 months ago