OPTIMAL
共 81 篇文章
OPTIMAL 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 81 篇文章，持续更新中。
bayeserr - Computes the Bayesian risk for optimal classifier. ％ bayescln - Classifier based on Baye
bayeserr - Computes the Bayesian risk for optimal classifier.
％ bayescln - Classifier based on Bayes decision rule for Gaussians.
％ bayesnd - Discrim. function, dichotomy, max aposteriori probabilit
模拟实现以下页面置换算法
模拟实现以下页面置换算法，并计算其命中率：
一、理想置换算法OPT（Optimal Replacemnet）
二、先进先出置换算法FIFO
G3-PLC技术使电动汽车智能化充电
<div>
Abstract: This article explores criteria necessary for reliable communication between electric vehicles (EVs) and electric vehicleservice equipment (EVSE). Data will demonstrate that a G3-PLC s
1-D optimal step size using golden section
1-D optimal step size using golden section
In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for un
In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussia
HMM(Hidden Markov Model)
HMM(Hidden Markov Model)，狀態數目N=3，觀察符號數目M=2，時間長度T=3。
(a) Probability Evaluation: 給定狀態轉換機率A、狀態符號觀察機率B、和起始機率 ，求觀察序列 出現的機率。
(b) Optimal State Sequence: 給定狀態轉換機率A、狀態符號觀察機率B、起始機率 、和觀察序列 ，求一個狀態序列 使得O出現的機率
算法的许多例子都是最优化问题（ optimization problem）
算法的许多例子都是最优化问题（ optimization problem），每个最优化问题都包含一组限制条件（ c o n s t r a i n t）和一个优化函数（ optimization function），符合限制条件的问题求解方案称为可行解（ feasible solution），使优化函数取得最佳值的可行解称为最优解（optimal solution）。
commande optimal (langue franche)
commande optimal (langue franche)
The NetBeans IDE has seen adoption snowballing over the past years, particularly with the introduc
The NetBeans IDE has seen adoption snowballing over the past
years, particularly with the introduction of a completely new,
rewritten, slick Java editor. You’ll fnd this reference card helpful
optimal portfoilio EXCELmin risk max return
optimal portfoilio EXCELmin risk max return
For this reason, iterative soft decoding has been studied to approach the optimal ML decoding perf
For this reason,
iterative soft decoding has been studied to approach the optimal
ML decoding performance at affordable complexity.
documentation for optimal filtering toolbox for mathematical software package Matlab. The methods i
documentation for optimal filtering toolbox for mathematical software
package Matlab. The methods in the toolbox include Kalman filter, extended Kalman filter
and unscented Kalman filter for discret
To understand the traffic mechanism and find optimal strategies to improve traffic capacity is one o
To understand the traffic mechanism and find optimal strategies to improve traffic capacity is one of the important issues we have to address.
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
Near-Optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
Near-Optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
MATLAB Code for Optimal Quincunx Filter Bank Design Yi Chen July 17, 2006 This file introduces t
MATLAB Code for Optimal Quincunx Filter
Bank Design
Yi Chen
July 17, 2006
This file introduces the MATLAB code that implements the two algorithms (i.e., Algorithms
1 and 2 in [1], or Algorithms 4
Optimal Binary Index Assignments for a Class of Equiprobable Scalar and Vector Quantizers
Optimal Binary Index Assignments for a Class of
Equiprobable Scalar and Vector Quantizers
MATSNL is a package of MATLAB M-files for computing wireless sensor node lifetime/power budget and s
MATSNL is a package of MATLAB M-files for computing wireless sensor node lifetime/power budget and solving optimal node architecture choice problems. It is intended as an analysis and simulation tool
0-1背包问题 将计算出的装入背包物品的最大价值和最优装入方案输出。第一行输出为：Optimal value is
0-1背包问题 将计算出的装入背包物品的最大价值和最优装入方案输出。第一行输出为：Optimal value is
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting