Results 41 to 50 of about 5,940,643 (309)
Lower bounds for the degree of approximation [PDF]
Transactions of the American Mathematical Society, 1960 is the optimal degree of approximation of 2W. In this paper we shall give simple methods which permit to find the order of magnitude of Dn(W) for several important classes ?1: for some classes of analytic functions (?6); for the unit ball AP+a of the space CP+a of functions with continuous derivatives of order p, which satisfy a Lipschitz condition ...
openaire +1 more source
On Solving Fully Rough Multi-Objective Integer Linear Programming Problems [PDF]
Delta Journal of Science, 2019 In this paper a suggested algorithm to solve fully rough multi-objectiveinteger linear programming problem [FRMOILP] is described. In orderto solve this problem and find rough value efficient solutions anddecision rough integer variables by the slice-sum
Abdusalam Emsimir, El-Saeed Ammar
doaj +1 more source
On lower bounds for Poisson approximation to 2-runs statistic
Lietuvos Matematikos Rinkinys, 2010 Two-runs statistic is approximated by various compound Poisson distributions and second order asymptotic expansions. Estimates of lower bounds are obtained for the uniform Kolmogorov and local metrics.
Jūratė Petrauskienė +1 more
doaj +1 more source
A lower bound for linear approximate compaction [PDF]
[1993] The 2nd Israel Symposium on Theory and Computing Systems, 2002 The lambda -approximate compaction problem is: given an input array of n values, each either 0 or 1, place each value in the output array so that all the 1s are in the first (1+ lambda )k array locations, where k is the number of 1's in the input. lambda is an accuracy parameter. This problem is of fundamental importance in parallel computation because
openaire +3 more sources
On the accuracy of the binomial approximation to the distance distribution of codes [PDF]
, 1995 The binomial distribution is a well-known approximation to the distance spectra of many classes of codes.
Krasikov, I +3 more
core +2 more sources
Approximation operators based on preconcepts
Open Mathematics, 2020 Using the notion of preconcept, we generalize Pawlak’s approximation operators from a one-dimensional space to a two-dimensional space in a formal context.
Wang Gang, Mao Hua
doaj +1 more source
Computing lower rank approximations of matrix polynomials [PDF]
Journal of Symbolic Computation, 2020 31 ...
Mark Giesbrecht +2 more
openaire +5 more sources
Variational inequations and approximation [PDF]
, 1974 The existence and uniqueness of the solution of a variational inequality is considered, and methods of approximation of the solution are given.
Noor, MA
core +4 more sources
Covering-Based Rough Single Valued Neutrosophic Sets [PDF]
Neutrosophic Sets and Systems, 2017 Rough sets theory is a powerful tool to deal with uncertainty and incompleteness of knowledge in information systems. Wang et al. proposed single valued neutrosophic sets as an extension of intuitionistic fuzzy sets to deal with real-world problems.
Yingcang Ma, Wanying Zhou, Qing Wan
doaj +1 more source
Soft Relations Applied to the Substructures of Quantale Module and Their Approximation
Complexity, 2022 This research article offers a study on a new relation of rough sets and soft sets with an algebraic structure quantale module by using soft reflexive and soft compatible relations.
Saqib Mazher Qurashi +4 more
doaj +1 more source