TITLE

compute bound

PUB. DATE
April 2016
SOURCE
Computer Desktop Encyclopedia;Apr2016, p1
SOURCE TYPE
Encyclopedia
DOC. TYPE
Reference Entry
ABSTRACT
See process bound.
ACCESSION #
114215119

 

Related Articles

  • CALL OF JUAREZ: BOUND IN BLOOD PC. Winchester, Henry // Australian PC User;Jul2009, Vol. 21 Issue 7, p101 

    The article reviews the computer game Call of Juarez: Bound in Blood developed by Techland.

  • Bounds for a class of stochastic recursive equations. Liu, Zhen; Nain, Philippe; Towsley, Don // Mathematical Methods of Operations Research;1999, Vol. 49 Issue 2, p325 

    Abstract. In this note we develop a framework for computing upper and lower bounds of an exponential form for a class of stochastic recursive equations with uniformly recurrent Markov modulated inputs. These bounds generalize Kingman's bounds for queues with renewal inputs.

  • Application of the Bergman–Milton theory of bounds to the permittivity of rocks. Korringa, J.; LaTorraca, G. A. // Journal of Applied Physics;10/15/1986, Vol. 60 Issue 8, p2966 

    Presents a study that proposed a scheme to analyze data on the permittivity of porous rocks on the basis of the theory of bounds. Even numbers of constraints; Computation of the bounds; Pole and zero diagrams for bounds and their vertices with even number of constraints.

  • A new bound for the quadratic assignment problem based on convex quadratic programming. Anstreicher, Kurt M.; Brixius, Nathan W. // Mathematical Programming;2001, Vol. 89 Issue 3, p341 

    Abstract. We describe a new convex quadratic programming bound for the quadratic assignment problem (QAP). The construction of the bound uses a semidefinite programming representation of a basic eigenvalue bound for QAP. The new bound dominates the well-known projected eigenvalue bound, and...

  • Influence of Lipschitz bounds on the speed of global optimization. Paulavičius, Remigijus; Žilinskas, Julius // Technological & Economic Development of Economy;2012, Vol. 18 Issue 1, p54 

    Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed...

  • Restricted-recourse bounds for stochastic linear programming. Morton, David P.; Wood, R. Kevin // Operations Research;Nov/Dec99, Vol. 47 Issue 6, p943 

    We consider the problem of bounding the expected value of a linear program (LP) containing random coefficients, with applications to solving two-stage stochastic programs. An upper bound for minimizations is derived from a restriction of an equivalent, penalty-based formulation of the primal...

  • A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem . Palubeckis, Gintaras // INFORMS Journal on Computing;Winter97, Vol. 9 Issue 1, p30 

    Describes a variation of the branch and bound method for solving a clustering problem stated as a partitioning problem on edge-weighted graphs. Features of the branch and bound method; Application of the Lagrangean method for obtaining lower bounds; Outline of the bound computation algorithm;...

  • NEW IMPROVED BOUNDS FOR RELIABILITY OF CONSECUTIVE-k-OUT-OF-n: F SYSTEMS. Muselli, Marco // Journal of Applied Probability;Dec2000, Vol. 37 Issue 4, p1164 

    Presents information on a study which discovered bounds for the reliability of consecutive-k-out-of-n:F systems with equal component failure probabilities. Employment of bounds in numerical computations; Comparison with other bounds; Graphical representation of the approximation error of the...

  • On Bounding Inverses to Nekrasov Matrices in the Infinity Norm. Kolotilina, L. // Journal of Mathematical Sciences;Jun2014, Vol. 199 Issue 4, p432 

    A new upper bound on the infinity norm of the inverse to a Nekrasov matrix, improving two recent bounds by L. Cvetkovi'c et al. (Appl. Math. Comput., 219, 5020-5024 (2013)), is obtained. Also it is shown that for a strictly diagonally dominant matrix, the bound suggested improves the classical...

  • Bounds in the Generalized Weber Problem under Locational Uncertainty. Juel, Henrik // Operations Research;Nov/Dec81, Vol. 29 Issue 6, p1219 

    An existing analysis of the bounds on the Weber problem solution under uncertainty is incorrect. For the generalized problem with arbitrary measures of distance, we give easily computable ranges on the bounds and state the conditions under which the exact values of the bounds can be found with...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics