Results 11 to 20 of about 156,468 (326)
Lower Bounds and Upper Bounds for MaxSAT [PDF]
, 2012 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 ...
Federico Heras +2 more
openaire +3 more sources
Lower and Upper Bounds for Nef Cones [PDF]
International Mathematics Research Notices, 2011 25 pages, 4 figures.
Gibney, Angela, Maclagan, Diane
openaire +3 more sources
Some New Bounds for Mathieu's Series [PDF]
, 2007 In the paper, an upper bound and two lower bounds for Mathieu’s series are established, which refine to a certain extent a sharp double inequality obtained by Alzer-Brenner-Ruehr in 1998.
Qi, Feng, Hoorfar, Abdolhossein
core +7 more sources
Lower and upper bounds of ς(3) [PDF]
, 2001 In this short note, using refinements of Jordan’s inequality and an integral expression of ς(3), the lower and upper bounds of ς(3) are obtained, and some related results are ...
Qi, Feng, Wei, Zong-Li, Luo, Qiu-Ming
core +6 more sources
Operator learning with PCA-Net: upper and lower complexity bounds [PDF]
Journal of machine learning research, 2023 PCA-Net is a recently proposed neural operator architecture which combines principal component analysis (PCA) with neural networks to approximate operators between infinite-dimensional function spaces.
S. Lanthaler
semanticscholar +1 more source
On the Inference of Resource Usage Upper and Lower Bounds
ACM Transactions on Computational Logic, 2013 Abu Naser Masud +2 more
exaly +2 more sources
Upper and Lower Bounds for Matrix Discrepancy
Journal of Fourier Analysis and Applications, 2022 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\mathbf ...
Jiaxin Xie, Zhiqiang Xu, Ziheng Zhu
openaire +3 more sources
“Lion and Man”: Upper and Lower Bounds [PDF]
ORSA Journal on Computing, 1992 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
Laurent Alonso +2 more
openaire +2 more sources
Asian Option Pricing Based on the Standardized Logarithm of Geometric Average [PDF]
فصلنامه پژوهشهای اقتصادی ایران, 2015 An Asian option (or average value option) is a special type of option contract. Its payoff is determined by the average underlying price over some pre-set period of time. Asian option is hard to price analytically and numerically.
Abdolrahim Badamchizadeh, Narges Heydari
doaj +1 more source
Upper and lower bounds for $F_v(4,4;5)$ [PDF]
The Electronic Journal of Combinatorics, 2010 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.
Xiaodong Xu 0006 +2 more
openaire +3 more sources