Results 11 to 20 of about 1,181,159 (209)
The Approximation Characteristics of Weighted p-Wiener Algebra
In this paper, we study the approximation characteristics of weighted p-Wiener algebra AωpTd for 1 ...
Ying Chen +3 more
doaj +1 more source
Approximate maximum weight branchings [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amitabha Bagchi +2 more
openaire +2 more sources
The Best Approximation of Generalized Fuzzy Numbers Based on Scaled Metric
The ongoing study has been vehemently allocated to propound an ameliorated α-weighted generalized approximation of an arbitrary fuzzy number. This method sets out to lessen the distance between the original fuzzy set and its approximation.
Tofigh Allahviranloo +5 more
doaj +1 more source
Weighted sparsity and sparse tensor networks for least squares approximation [PDF]
The approximation of high-dimensional functions is a ubiquitous problem in many scientific fields that is only feasible practically if advantageous structural properties can be exploited. One prominent structure is sparsity relatively to some basis.
Trunschke, Philipp +2 more
core +1 more source
Approximating Power by Weights [PDF]
Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights, which is very beneficial for both theoretical considerations and practical computations with many members.
openaire +2 more sources
On Kantorovich modification of ( p , q ) $( p,q ) $ -Baskakov operators
The concern of this paper is to introduce a Kantorovich modification of ( p , q ) $( p,q ) $ -Baskakov operators and investigate their approximation behaviors. We first define a new ( p , q ) $( p,q ) $ -integral and construct the operators.
Tuncer Acar +2 more
doaj +1 more source
Approximate BDD Minimization by Weighted A. [PDF]
Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e. the size may vary from linear to exponential, and the existence of a polynomial algorithm to approximate the ...
Rüdiger Ebendt, Rolf Drechsler
openaire +8 more sources
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines [PDF]
We study the classic weighted maximum throughput problem on unrelated machines. We give a (1-1/e-ε)-approximation algorithm for the preemptive case. To our knowledge this is the first ever approximation result for this problem.
Karakostas, George +1 more
core +1 more source
Approximation with exponential weights in [−1,1]
Let \(w(x):=\exp(-1/(1-x^2)^\alpha)\), \(\alpha>0\), \(|x|
DELLA VECCHIA, Biancamaria +2 more
openaire +3 more sources
On ( p , q ) $(p,q)$ -Szász-Mirakyan operators and their approximation properties
In the present paper, we introduce a new modification of Szász-Mirakyan operators based on ( p , q ) $(p, q)$ -integers and investigate their approximation properties. We obtain weighted approximation and Voronovskaya-type theorem for new operators.
M Mursaleen +2 more
doaj +1 more source

