Results 261 to 270 of about 175,129,583 (297)
Some of the next articles are maybe not open access.
A FUNCTION APPROXIMATION ALGORITHM USING SEQUENTIAL COMPOSITION
International Journal of Neural Systems, 1993A new method for approximating one dimensional functions is developed based on structural capabilities of multilayer feedforward neural networks. It possesses notable but unproven convergence properties which are examined in a series of examples. It is shown that it outperforms conventional networks for complicated one dimensional problems.
openaire +2 more sources
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Mathematics of Operations Research, 1978A real-valued function z whose domain is all of the subsets of N = {1, …, n) is said to be submodular if z(S) + z(T) ≥ z(S ∪ T) + z(S ∩ T), ∀S, T ⊆ N, and nondecreasing if z(S) ≤ z(T), ∀S ⊂ T ⊆ N. We consider the problem maxS⊂N {z(S): |S| ≤ K, z submodular and nondecreasing, z(Ø) = 0}.
George L. Nemhauser, Laurence A. Wolsey
openaire +2 more sources
An Algorithm for the Approximation of the Solution of a Functional-Integral Equation
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009In this paper we consider a functional-integral equation with linear modification of the argument. By applying the successive approximation method and by using the trapezoidal formula we give an algorithm for the approximation of the solution of this equation.
openaire +1 more source
THE JACOBI-PERRON ALGORITHM AND SIMULTANEOUS APPROXIMATION OF FUNCTIONS
Mathematics of the USSR-Sbornik, 1982A generalization of the Jacobi-Perron algorithm to the case of functions is considered. The rate is determined for the convergence (with respect to the coefficients of the Laurent series) of the generating rational functions to the functions that are being expanded in a continued fraction by means of this algorithm. A necessary and sufficient condition
openaire +1 more source
Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
The Computer Journal, 1999Summary: The discovery of functional dependencies from relations is an important database analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases. TANE is based on partitioning the set of rows with respect to their attribute values, which makes testing the validity of functional dependencies ...
Ykä Huhtala +3 more
openaire +3 more sources
Approximating the zeros of analytic functions by the exclusion algorithm
Numerical Algorithms, 1994The author establishes an iterative algorithm for approximating those zeros of a given function \(f\) holomorphic on \(\mathbb{C}\) lying within a prescribed compact set \(E_ 0\subset \mathbb{C}\). The main tool is an exclusion function \(m\) satisfying \(m(z_ 0) = 0\) iff \(f(z_ 0) = 0\) and s.t.
openaire +2 more sources
A Randomized Algorithm for Weighted Approximation of Points by a Step Function
Discrete Mathematics, Algorithms and Applications, 2010The problem considered in this paper is: Given an integer k > 0 and a set P of n points in the plane each with a corresponding nonnegative weight, find a step function f with k steps that minimize the maximum weighted vertical distance between f and all the points in P.
openaire +3 more sources
Evolutionary Algorithm in Approximation of Defuzzification Functional
AIP Conference Proceedings, 2010The space of ordered fuzzy numbers (OFN) forms a normed space on which defuzzification functionals can be defined. They play the main role when dealing with fuzzy controllers and fuzzy inference systems. An approximation formula for a general nonlinear functional is given.
Katarzyna Wȩgrzyn-Wolska +5 more
openaire +1 more source
ABOUT AN ALGORITHM OF FUNCTION APPROXIMATION BY THE LINEAR SPLINES
2016The actual application for the problem of best approximation of grid functionby linear splines was formulated. A mathematical model and a method for its solution were developed. Complexity of the problem was that it was multi - extremal and could not be solved analytically.
BAYRAKTAR, B., KUDAEV, V.
openaire +3 more sources
Anytime Algorithms for Approximate Functional Dependencies
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2Sanjivni Rana +4 more
openaire +2 more sources