Sciweavers

1763 search results - page 170 / 353
» Dependent random choice
Sort
View
USENIX
2000
13 years 9 months ago
Performing Replacement in Modem Pools
We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a repl...
Yannis Smaragdakis, Paul R. Wilson
WSC
2000
13 years 9 months ago
Quasi-Monte Carlo methods in cash flow testing simulations
What actuaries call cash flow testing is a large-scale simulation pitting a company's current policy obligation against future earnings based on interest rates. While life co...
Michael G. Hilgers
CORR
2008
Springer
227views Education» more  CORR 2008»
13 years 8 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
ECCC
2010
95views more  ECCC 2010»
13 years 8 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
ENTCS
2008
120views more  ENTCS 2008»
13 years 8 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier