APPROXIMATE
共 35 篇文章
APPROXIMATE 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 35 篇文章，持续更新中。
01 Maryland PhD Approximate nonlinear filtering with applications to navigation.pdf
资料->【E】光盘论文->【E1】斯坦福博士论文->01 Maryland PhD Approximate nonlinear filtering with applications to navigation.pdf
Infineon-IPOSIM-ST-v07_09
<p>IPOSIM performs an approximate calculation of switching and conduction losses for IGBTs and</p><p>free-wheeling diodes in a three phase inverter configuration under the assumption of sinusoidal</p>
Bishop-Pattern-Recognition-and-Machine-Learning
Pattern recognition has its origins in engineering, whereas machine learning grew<br />
out of computer science. However, these activities can be viewed as two facets of<br />
the same field, and toge
magentic approximate counter using atmega8
magentic approximate counter using atmega8
genetic algorithm (or GA) is a search technique used in computing to find true or approximate soluti
genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization and search problems
for function of 2 variable
The Hilbert Transform is an important component in communication systems, e.g. for single sideband m
The Hilbert Transform is an important component in communication systems, e.g. for single sideband modulation/demodulation, amplitude and phase detection, etc. It can be formulated as filtering operat
Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by loo
Basic function to locate and measure the positive peaks in a noisy
data sets. Detects peaks by looking for downward zero-crossings
in the smoothed third derivative that exceed SlopeThreshold
an
A stability analysis is presented for staggered schemes for the governing equations of compressible
A stability analysis is presented for staggered schemes for the governing equations of compressible flow. The
method is based on Fourier analysis. The approximate nature of pressure-correction soluti
This paper presents a visual based localization mechanism for a legged robot. Our proposal, fundame
This paper presents a visual based localization
mechanism for a legged robot. Our proposal, fundamented
on a probabilistic approach, uses a precompiled topological
map where natural landmarks like
The main features of the considered identification problem are that there is no an a priori separati
The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not
The package includes 3 Matlab-interfaces to the c-code: 1. inference.m An interface to the full
The package includes 3 Matlab-interfaces to the c-code:
1. inference.m
An interface to the full inference package, includes several methods for
approximate inference: Loopy Belief Propagation,
GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to so
GloptiPoly 3: moments, optimization and
semidefinite programming.
Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of
Moments (GPM), an infinite-dimensional opt
As a consequence, more exact models of devices can be retained for analysis rather than the approxi
As a consequence, more exact models of devices can
be retained for analysis rather than the approximate models commonly introduced
for the sake of computational simplicity. A computer icon appears i
As a consequence, more exact models of devices can be retained for analysis rather than the approxi
As a consequence, more exact models of devices can
be retained for analysis rather than the approximate models commonly introduced
for the sake of computational simplicity. A computer icon appears i
As a consequence, more exact models of devices can be retained for analysis rather than the approxi
As a consequence, more exact models of devices can
be retained for analysis rather than the approximate models commonly introduced
for the sake of computational simplicity. A computer icon appears i
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F
/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INP
A series of .c and .m files which allow one to perform univariate and bivariate wavelet analysis of
A series of .c and .m files which allow one to perform univariate and bivariate wavelet analysis of discrete time series. Noother wavelet package is necessary -- everything is contained in this archiv
a collection of M-files to study concepts in the following areas of Fuzzy-Set-Theory: Fuzzy or Multi
a collection of M-files to study concepts in the following areas of Fuzzy-Set-Theory: Fuzzy or Multivalued Logic, The Calculus of Fuzzy, Quantities, Approximate Reasoning, Possibility Theory, Fuzzy Co
The present paper deals with the problem of calculating mean delays in polling systems with either
The present paper deals with the problem of calculating mean delays in polling systems
with either exhaustive or gated service. We develop a mean value analysis (MVA) to
compute these delay figures.
Computes approximate significance points of a Pearson curve with given first four moments, or first
Computes approximate significance points of a Pearson curve with given first four moments, or first three moments and left or right boundary