Results 11 to 20 of about 58,584 (207)
Upper and Lower Bounds for Capital and Wages
El artículo estudia la división de un sistema de producción en los departamentos I y II e introduce una división posterior del departamento II en un sector homotético y otro complementario.
Alberto Benítez Sánchez +1 more
doaj +5 more sources
Upper and lower optimal stopping bounds [PDF]
V. M. Khametov, Elena Shelemeh
openalex +2 more sources
Upper and Lower Bounds for Matrix Discrepancy
The aim of this paper is to study the matrix discrepancy problem. Assume that $ _1,\ldots, _n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be the minimal constant for which the following holds: \[ {\rm Disc}(\mathbf{u}_1\mathbf{u}_1^*,\ldots,\mathbf{u}_n ...
Jiaxin Xie, Zhiqiang Xu, Ziheng Zhu
openaire +3 more sources
“Lion and Man”: Upper and Lower Bounds [PDF]
Given a lion and a man, their initial positions, and restrictions on their ranges and speeds, how quickly can the lion get within a given distance from the man? We consider the case in which the lion and man are restricted to the interior of a circle and each is limited to the same speed. INFORMS Journal on Computing, ISSN 1091-9856, was published as
Alonso, Laurent +2 more
openaire +1 more source
Upper and Lower Bounds of Born Approximation, II [PDF]
The properties of three dimensional Born approximation are investigated along similar lines as Part 1. Relations between one dimensional and three dimensional Born approximations are elucidated . . We also compare the convergence radii for both approximations for typical examples.
Takashi Kikuta
openalex +4 more sources
Lower Bounds and Upper Bounds for MaxSAT [PDF]
This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Heras, Federico +2 more
openaire +2 more sources
Upper and lower bounds for $F_v(4,4;5)$ [PDF]
In this note we give a computer assisted proof showing that the unique $(5,3)$-Ramsey graph is the unique $K_5$-free graph of order 13 giving $F_v(3,4;5) \leq 13$, then we prove that $17 \leq F_v(2,2,2, 4; 5) \leq F_v(4, 4; 5) \leq 23$. This improves the previous best bounds $16 \leq F_v(4, 4; 5) \leq 25$ provided by Nenov and Kolev.
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui
openaire +2 more sources
Lower and Upper Bounds for Nef Cones [PDF]
25 pages, 4 figures.
Gibney, Angela, Maclagan, Diane
openaire +2 more sources
Improving bounds on packing densities of 4-point permutations [PDF]
We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342.
Jakub Sliacan, Walter Stromquist
doaj +1 more source
Upper and lower bounds on gravitational entropy [PDF]
The gravitational entropy of the Universe is large and subtle to calculate. A lower bound is well known from supermassive black holes at the centers of galaxies, but the remainder is harder to pin down. A parametric model of clumped matter entropy is provided.
Frampton, Paul H., Kephart, Thomas W.
openaire +2 more sources

