Results 1  10
of
1,909,717
Exact Upper Bounds And Their Uses In Set Theory
 Ann. Pure Appl. Logic
"... The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and sufficient condition for the existence of an exact upper bound f for a ! I  increasing sequence f = hf ff : ff ! i ` On A w ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and sufficient condition for the existence of an exact upper bound f for a ! I  increasing sequence f = hf ff : ff ! i ` On A
Exact Upper Bound on the Mean of the Product of Many Random Variables with Known Expectations
, 2002
"... In practice, in addition to the intervals x i = [x i ; x i ] of possible values of inputs x1 ; : : : ; xn , we sometimes also know their means E i . For such cases, we provide an explicit exact (= best possible) upper bound for the mean of the product x1 \Delta : : : \Delta xn of positive values ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In practice, in addition to the intervals x i = [x i ; x i ] of possible values of inputs x1 ; : : : ; xn , we sometimes also know their means E i . For such cases, we provide an explicit exact (= best possible) upper bound for the mean of the product x1 \Delta : : : \Delta xn of positive values
Abstract COMMENT ON EXACT UPPER BOUND ON BARRIER PRENETRATION PROBABILITIES IN MANYBODY SYSTEMS
"... We investigate conditions under which it is not possible to establish an exact upper bound for the barrier penetration probability of nuclei tunneling to classically forbidden small relative separation, by a value calculable in terms of the BornOppenheimer potential between nuclei. 1. ..."
Abstract
 Add to MetaCart
We investigate conditions under which it is not possible to establish an exact upper bound for the barrier penetration probability of nuclei tunneling to classically forbidden small relative separation, by a value calculable in terms of the BornOppenheimer potential between nuclei. 1.
AN EXACT UPPER BOUND FOR THE GROUNDSTATE ENERGY OF THE TRIANGULAR ANTIFERROMAGNETIC LATTICE BY MEANS OF A RENORMALIZATION PROCEDURE
, 1978
"... A renormalization procedure gives a rigorous upper bound for the groundstate nergy per spin for the triangular antiferromagnetic lattice with Heisenberg interaction. Recently renormalization techniques have offered new possibilities to calculate approximate values for the groundstate energy of an ..."
Abstract
 Add to MetaCart
A renormalization procedure gives a rigorous upper bound for the groundstate nergy per spin for the triangular antiferromagnetic lattice with Heisenberg interaction. Recently renormalization techniques have offered new possibilities to calculate approximate values for the groundstate energy
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
, and that outputs samples in exact accordance with the desired distribution. The method uses couplings, which have also played a role in other sampling schemes; however, rather than running the coupled chains from the present into the future, one runs from a distant point in the past up until the present, where
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particular realization of the N = 2 theories, the resulting string field theory is equivalent to a topological theory in six dimensions, the Kodaira– Spencer theory, which may be viewed as the closed string analog of the Chern–Simon theory. Using the mirror map this leads to computation of the ‘number ’ of holomorphic curves of higher genus curves in Calabi–Yau manifolds. It is shown that topological amplitudes can also be reinterpreted as computing corrections to superpotential terms appearing in the effective 4d theory resulting from compactification of standard 10d superstrings on the corresponding N = 2 theory. Relations with c = 1 strings are also pointed out.
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES
, 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract

Cited by 2217 (2 self)
 Add to MetaCart
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 710 (31 self)
 Add to MetaCart
realtime service is capable of creating realtime channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper
Results 1  10
of
1,909,717