Results 11 to 20 of about 432,921 (266)
Reachability Games with Relaxed Energy Constraints [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same ...
Loïc Hélouët +2 more
doaj +1 more source
Upper Bound Approximation for BlockMaxWand [PDF]
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017 BlockMaxWand is a recent advance on the Wand dynamic pruning technique, which allows efficient retrieval without any e.ectiveness degradation to rank K. However, while BMW uses docid-sorted indices, it relies on recording the upper bound of the term weighting model scores for each block of postings in the inverted index.
Craig Macdonald, Nicola Tonellotto
openaire +2 more sources
Variational Inference via Rényi Bound Optimization and Multiple-Source Adaptation
Entropy, 2023 Variational inference provides a way to approximate probability densities through optimization. It does so by optimizing an upper or a lower bound of the likelihood of the observed data (the evidence).
Dana Zalman (Oshri), Shai Fine
doaj +1 more source
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 +2 more sources
An Upper Bound for Min-Max Angle of Polygons [PDF]
Mathematics Interdisciplinary Research, 2023 Let $S$ be a set of $n$ points in the plane, $\nabla(S)$ the set of all simple polygons crossing $S$, $\gamma_P$ the maximum angle of polygon $P \in \nabla(S)$ and $\theta =min_{P\in\nabla(S)} \gamma_P$.
Saeed Asaeedi +2 more
doaj +1 more source
On the Monotone Upper Bound Problem [PDF]
Experimental Mathematics, 2004 The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by McMullen's (1970) Upper Bound Theorem is tight, where M_{ubt}(d,n) is the number of vertices of a dual-to-cyclic d-
Pfeifle, Julián, Ziegler, Günter M.
openaire +4 more sources
Bounds for blow-up time in a semilinear pseudo-parabolic equation with nonlocal source
Journal of Inequalities and Applications, 2016 This paper considers the following semilinear pseudo-parabolic equation with a nonlocal source: u t − △ u t − △ u = u p ( x , t ) ∫ Ω k ( x , y ) u p + 1 ( y , t ) d y , $$ u_{t}-\triangle u_{t}-\triangle u=u^{p}(x,t) \int_{\Omega}k(x,y)u^{p+1}(y,t)\,dy,
Yang Lu, Liang Fei
doaj +1 more source
An Upper Bound in Goldbach's Problem [PDF]
Mathematics of Computation, 1993 It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [
Deshouillers, Jean-Marc +3 more
openaire +2 more sources
Mine Productivity Upper Bounds and Truck Dispatch Rules
Mining, 2023 This paper proposes an upper bound for mine productivity (useful for long-term planning) and also a simple truck dispatch rule (useful for short-term operations) that demonstrates how tight the upper bound can be using a simulation.
Adriano Chaves Lisboa +2 more
doaj +1 more source
Physical Review Letters, 2017 The linear growth of operators in local quantum systems leads to an effective light cone even if the system is nonrelativistic. We show that the consistency of diffusive transport with this light cone places an upper bound on the diffusivity: D≲v^{2}τ_{eq}.
Thomas, Hartman +2 more
openaire +3 more sources