Sciweavers

5785 search results - page 206 / 1157
» Approximability of Probability Distributions
Sort
View
PDCAT
2005
Springer
15 years 9 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 7 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
COLCOM
2005
IEEE
15 years 9 months ago
Stochasticity of probabilistic systems: analysis methodologies case-study
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a ...
Anwitaman Datta, Martin Hasler, Karl Aberer
WSC
1998
15 years 5 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
JOI
2011
93views more  JOI 2011»
14 years 11 months ago
Bibliometric rankings of journals based on Impact Factors: An axiomatic approach
This paper proposes an axiomatic analysis of Impact Factors when used as tools for ranking journals. This analysis draws on the similarities between the problem of comparing distr...
Denis Bouyssou, Thierry Marchant