Sciweavers

1763 search results - page 343 / 353
» Dependent random choice
Sort
View
WSC
2001
13 years 9 months ago
On the MSE robustness of batching estimators
Variance is a classical measure of a point estimator's sampling error. In steady-state simulation experiments, many estimators of this variance--or its square root, the stand...
Yingchieh Yeh, Bruce W. Schmeiser
MASCOTS
2003
13 years 9 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 9 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
SPRINGSIM
2007
13 years 9 months ago
Modeling and analysis of worm defense using stochastic activity networks
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
David M. Nicol, Steve Hanna, Frank Stratton, Willi...
EUROGRAPHICS
2010
Eurographics
13 years 9 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould