Results 21 to 30 of about 3,729,724 (366)
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
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
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
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
“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
Polynomial solutions to constant coefficient differential equations [PDF]
Transactions of the American Mathematical Society, 1992 Let D 1 , … , D r ∈ C [ ∂ / ∂ x 1 , … , ∂ / ∂
Paul Smith, S. P. Smith
semanticscholar +3 more sources
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial time computable
Peter Hertling, Christoph Spandl
doaj +1 more source
Dwork's congruences for the constant terms of powers of a Laurent polynomial [PDF]
, 2013 We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial analytic ...
A. Mellit, Masha Vlasenko
semanticscholar +1 more source
On a Linear Program for Minimum-Weight Triangulation [PDF]
, 2013 Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT.
Arman Yousefi +15 more
core +3 more sources