Sciweavers

244 search results - page 23 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
WSC
2007
13 years 11 months ago
Efficient suboptimal rare-event simulation
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these id...
Xiaowei Zhang, Jose Blanchet, Peter W. Glynn
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
14 years 9 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Various Representations and Algebraic Structure of Linear Imprecision Indices
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...
Alexander E. Lepskiy, Andrey G. Bronevich
JMLR
2010
111views more  JMLR 2010»
13 years 3 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
ESM
2000
13 years 10 months ago
Wide area network module - for FDT based simulation of multicast communication protocols
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...
Eugen Borcoci, Stanislaw Budkowski