«approximation»
۴۹۴٬۱۶۱ نتیجهFuzzy basis functions for triangle-shaped membership functions: Universal approximation - MISO case
In this paper, the universal approximation property of one of the most frequently used type of fuzzy systems is proved. The type of fuzzy system in the present work employs triangle-shaped fuzzy membership functions (TSMF) for its input variables. The proof of the universal appro
On anelliptic approximations for qP velocities in VTI media
A unified approach to approximating phase and group velocities of qP seismic waves in a transversely isotropic medium with vertical axis of symmetry (VTI) is developed. While the exact phase-velocity expressions involve four independent parameters to characterize the elastic medi
Bridging gap between standard and differential polynomial approximation: the case of bin-packing
The purpose of this paper is to mainly prove the following theorem: for every polynomial time algorithm running in time T (n) and guaranteeing standard-approximation ratio ρ for bin-packing, there exists an algorithm running in time O(nT (n)) and achieving differentialapproximati
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
In exact arithmetic, the simplex method applied to a particular linear programming problem instance either shows that it is infeasible, shows that its dual is infeasible, or generates optimal solutions to both problems. Interiorpoint methods do not provide such clear-cut informat
2.2 Stochastic, Approximate and Neural Computing
Stochastic circuits (SCs) offer tremendous area and power-consumption benefits at the expense of computational inaccuracies. Managing accuracy is a central problem in SC design and has no counterpart in conventional circuit synthesis. It raises a basic question: how to build a sy
Implementing approximate regularities
K e y w o r d s A p p r o x i m a t e regularities, Approximate period, Approximate cover, Approximate seed, Hamming distance, Edit distance, Weighted edit distance, Smallest distance approximation, Restricted smallest distance approximation. 1. I N T R O D U C T I O N Find ing r
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
The 2-Opt heuristic is a very simple, easy-to-implement local search heuristic for the traveling salesman problem. While it usually provides good approximations to the optimal tour in experiments, its worst-case performance is poor. In an attempt to explain the approximation perf
Convergence Theorem for Difference Approximations of Hyperbolic Quasi-Linear Initial-Boundary Value Problems*
Dissipative difference approximations to multi-dimensional hyperbolic quasi-linear initial-boundary value problems are considered. The difference approximation is assumed to be consistent with the differential problem and its linearization should be stable in /2. A formal asympto
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge
This chapter proposes a framework for specifying, constructing, and managing a particular class of approximate knowledge structures for use with intelligent artifacts ranging from simpler devices such as personal digital assistants to more complex ones such as unmanned aerial veh
Floating-Point L-Approximations
Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the L se