搜索结果
找到约 238 项符合
Least-square 的查询结果
其他 Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of
Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a square.
matlab例程 New users and old of optimization in MATLAB will find useful tips and tricks in this document, as we
New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems.
Use this tool by editing the file optimtips.m, then execute blocks of code in cell mode from the editor, or best, publish the file to H ...
matlab例程 Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
其他书籍 This paper examines the asymptotic (large sample) performance of a family of non-data aided feedfor
This paper examines the asymptotic (large sample) performance
of a family of non-data aided feedforward (NDA FF) nonlinear
least-squares (NLS) type carrier frequency estimators for burst-mode
phase shift keying (PSK) modulations transmitted through AWGN and
flat Ricean-fading channels. The asymptoti ...
matlab例程 Comparison of the performances of the LS and the MMSE channel estimators for a 64 sub carrier OFDM
Comparison of the performances of the LS and the MMSE channel estimators
for a 64 sub carrier OFDM system based on the parameter of Mean square error
游戏 Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your startin
Ink Blotting
One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square
is marked with the number ‘1’. All free, valid squares north, south, east and west around the
number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around ...
文章/文档 Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal tra ...
人工智能/神经网络 PCA and PLS aims:to get some insight into the bilinear factor models Principal Component Analysis
PCA and PLS aims:to get some
insight into the bilinear factor models Principal Component Analysis
(PCA) and Partial Least Squares (PLS) regression, focusing on the
mathematics and numerical aspects rather than how s and why s of
data analysis practice. For the latter part it is assumed (but not
abso ...
其他书籍 μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with
μC/OS-II Goals
Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an
application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application
code should require only minor changes (if any). Als ...
单片机开发 This example demo code is provided as is and has no warranty, implied or otherwise. You are free to
This example demo code is provided as is and has no warranty,
implied or otherwise. You are free to use/modify any of the provided
code at your own risk in your applications with the expressed limitation
of liability (see below) so long as your product using the code contains
at least one uPSD produ ...