polynomial-time approximation algorithm
An Iterative-Algorithmically Modified use of Bernstein's Polynomial Operator for an Optimally-Close Polynomial Approximation using Computational Intelligence
... In approximation theory the celebrated Weirstrass, ...in polynomial approximation. Bernstein polynomial approximation operator was very popular for quite some ...such algorithm, ...
5
Efficient Rounding for the Noncommutative Grothendieck Inequality
... in polynomial time with arbitrarily good precision (see [17]), the fact that the Grothendieck optimization problem admits a polynomial-time constant-factor approximation ...
39
A polynomial time algorithm for computing the area under a GDT curve
... Background: Progress in the field of protein three-dimensional structure prediction depends on the development of new and improved algorithms for measuring the quality of protein models. Perhaps the best descriptor of ...
8
Combinatorial auctions with verification are tractable
... possible approximation guarantee in polynomial time, even if bidders are double-minded ...possible approximation guarantees achievable by any polynomial-time algorithm ...
18
Clique cover and graph separation : new incompressibility results
... an algorithm for Edge Clique Cover may be used to reveal a structure in a complex real-world network ...including approximation upper and lower bounds [2, 52], heuristics [3, 33, 46, 47, 58, 59], and ...
21
Synchronous Context Free Grammars and Optimal Parsing Strategies
... optimal time and space complexity. For time complexity, there is no benefit to considering parsing strategies that combine more than two subsets at a ...between time and space ...both time and ...
37
On scenario aggregation to approximate robust combinatorial optimization problems
... central approximation algorithm in robust ...find polynomial time (εK)-approximations for any constant ε ∈ (0, 1], thus improving several currently known best approximability ...
12
Polynomial Approximation On Unbounded Subsets And Some Applications
... in the space L 1 ( R n ). On the other hand, the linear positive operator F 0 has a linear positive extension F defined on the space of all integrable functions with their absolute value dominated on R n by a ...
16
Some contributions to the theory and application of polynomial approximation
... Bernstein polynomial, wMch is clearly a poor practical piopomtion# Besides, m Ims already been remarked, the data may not actually be convex, due to experimental error# Therefore the Bernstein polynomial» ...
115
Algorithm and Complexity Lctn Herbert S Wilf pdf
... Of course the creation of these two graphs from the original input graph is just the beginning of the story, as far as the computation is concerned. Unbeknownst to the programmer, who innocently wrote the recursive ...
139
Computation on Corrosion Influence in Ultimate Strength and Strain Depending on Time
... over time, due to the fact that, according to the standard, the different corrosion categories are determined depending on the loss of section (weight loss) for 1 year ...over time ultimate strength and ...
9
The Method of Polynomial Approximation to Determine the "Optimal" Coefficients of the Mathematical Models of Corrosive Destruction. Algorithm 1
... of polynomial approximation for the determination of the “optimal” coefficients of influence of SSS of the design on the rate of corrosion at its optimal designing is ...
11
Practical polynomial factoring in polynomial time
... factoring algorithm to use LLL for the recombination phase was designed and in this case traces were used for the p-adic ...every time any call to LLL made a switch (step 2b of Algorithm ...
9
Finite volume - space-time discontinuous Galerkin method for the numerical simulation of compressible turbulent flow in time dependent domains
... in time dependent ...piecewise polynomial discontinuous approximation of the sought solution in space and in ...constant approximation of the sought ...
8
An algorithm for the spectral factorization of unimodular para hermitian polynomial matrices in continuous time
... Most of the algorithms for the spectral factorizations of matrix polynomials depend on the existence of the roots of given polynomial matrices, so it is almost impossible to execute the [r] ...
7
Patch-based models and algorithms for image denoising: a comparative review between patch-based images denoising methods for additive noise reduction
... It is now common in image denoising field to uti- lize patch-based models and algorithms instead of pixel- based approaches to produce most promising estimate of the noise-free images. However, there are both advan- ...
27
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
... constant time whether j is contained in a B ν -block B ν j or in a A ν -block A ν j at level ...n) time. The overall time complexity of each of the procedures Updateleft and Updateright is O(log 2 n) ...
35
Algorithm to Compute Sudoku Solution by Using Constraint Satisfaction and Permutation in Polynomial Time
... ABSTRACT: A standard Sudoku puzzle has a 9 x 9 grid which is to be filled with numbers 1-9 in such a way that the numbers are not repeated in individual row, column or the 9 mini-grids of 3 x 3. A partially filled grid ...
5
The chromatic sum of a graph: history and recent developments
... Another interesting application is given by Kroon et al. in their 1996 paper [8]. They show that OCCP problem for interval graphs is equivalent to the fixed interval sched- uling problem with machine-dependent processing ...
11
Application of the Method of Polynomial Approximation for the Determining the "Optimal" Coefficient of the Mathematical Model of Corrosive Destruction. Algorithm 2
... the algorithm of polynomial approximation, in which the geometric parameters of the optimized design, in particular, its stiffness, depend on the value of the coefficient of influence of the ...
10