Results 11 to 20 of about 3,709,601 (369)
Logarithmic corrected polynomial f(R) inflation mimicking a cosmological constant [PDF]
, 2016 In this paper, we consider an inflationary model of $f(R)$ gravity with polynomial form plus logarithmic term. We calculate some cosmological parameters and compare our results with the Plank 2015 data.
J. Sadeghi +3 more
openalex +3 more sources
Is Catalan’s Constant Rational?
Mathematics, 2022 This paper employs a contour integral method to derive and evaluate the infinite sum of the Euler polynomial expressed in terms of the Hurwitz Zeta function. We provide formulae for several classes of infinite sums of the Euler polynomial in terms of the
Robert Reynolds, Allan Stauffer
doaj +1 more source
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and weight w_j. The goal is to find a preemptive schedule which minimizes the sum of weighted flow-time
Jatin Batra, Naveen Garg, Amit Kumar
semanticscholar +1 more source
Asymptotics of Polynomial Interpolation and the Bernstein Constants [PDF]
Results in Mathematics, 2021 AbstractIt is well known that the interpolation error for $$\left| x\right| ^{\alpha },\alpha >0$$ x α , α > 0
openaire +3 more sources
Journal of Mathematics, 2022 In the paper, we study the upper bound estimation of the Lebesgue constant of the bivariate Lagrange interpolation polynomial based on the common zeros of product Chebyshev polynomials of the second kind on the square −1,12. And, we prove that the growth
Juan Liu, Laiyi Zhu
doaj +1 more source
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 We consider the classic scheduling problem of minimizing the total weighted flow-time on a single machine (min-WPFT), when preemption is allowed. In this problem, we are given a set of n jobs, each job having a release time rj, a processing time pj, and ...
U. Feige, Janardhan Kulkarni, Shi Li
semanticscholar +1 more source
“SPOCU”: scaled polynomial constant unit activation function
Neural computing & applications (Print), 2020 We address the following problem: given a set of complex images or a large database, the numerical and computational complexity and quality of approximation for neural network may drastically differ from one activation function to another.
J. Kiselák +4 more
semanticscholar +1 more source
Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width
Foundations of Computing and Decision Sciences, 2021 The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are ...
Aydin Tuba Ağirman +2 more
doaj +1 more source
Constant term identities and Poincaré polynomials [PDF]
Transactions of the American Mathematical Society, 2015 In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald’s constant term identities admit an extra set of free parameters, thereby linking them to Poincaré polynomials.
Károlyi, Gyula +2 more
openaire +4 more sources
Learning Read-Constant Polynomials of Constant Degree Modulo Composites [PDF]
Theory of Computing Systems, 2011 Peer ...
Chattopadhyay, Arkadev +3 more
openaire +4 more sources