代码搜索：optimization
找到约 10,000 项符合「optimization」的源代码
代码结果 10,000
www.eeworm.com/read/212307/15160094
m contents.m
% Netlab Toolbox
% Version 3.2.1 31-Oct-2001
%
% conffig - Display a confusion matrix.
% confmat - Compute a confusion matrix.
% conjgrad - Conjugate gradients optimization.
% consist - Ch
www.eeworm.com/read/212307/15160118
m graddesc.m
function [x, options, flog, pointlog] = graddesc(f, x, options, gradf, ...
varargin)
%GRADDESC Gradient descent optimization.
%
% Description
% [X, OPTIONS, FLOG, POINTLOG] = GRADDESC(F, X, OPTIONS
www.eeworm.com/read/13871/284595
m graddesc.m
function [x, options, flog, pointlog] = graddesc(f, x, options, gradf, ...
varargin)
%GRADDESC Gradient descent optimization.
%
% Description
% [X, OPTIONS, FLOG, POINTLOG] = GRADDESC(F, X, OP
www.eeworm.com/read/471707/1425623
c resample_mmx.c
// MMX optimizations from Michael Niedermayer (michaelni@gmx.at) (under GPL)
/* optimization TODO / NOTES
movntq is slightly faster (0.5% with the current test.c benchmark)
(but thats just te
www.eeworm.com/read/470720/1452291
c mi6.c
/* Another test case for over-eager multiple include optimization,
where the leading "#if !defined" expression is obtained partially,
or wholly, from macros. Neil Booth, 30 Sep 2001. */
/* {
www.eeworm.com/read/470720/1452440
c mi6.c
/* Another test case for over-eager multiple include optimization,
where the leading "#if !defined" expression is obtained partially,
or wholly, from macros. Neil Booth, 30 Sep 2001. */
/* {
www.eeworm.com/read/470693/1464237
c mi6.c
/* Another test case for over-eager multiple include optimization,
where the leading "#if !defined" expression is obtained partially,
or wholly, from macros. Neil Booth, 30 Sep 2001. */
/* {
www.eeworm.com/read/470693/1464386
c mi6.c
/* Another test case for over-eager multiple include optimization,
where the leading "#if !defined" expression is obtained partially,
or wholly, from macros. Neil Booth, 30 Sep 2001. */
/* {
www.eeworm.com/read/459651/1566522
java moead_main.java
/**
* MOEAD_main.java
*
* @author Antonio J. Nebro
* @version 1.0
*
* This class executes the algorithm described in:
* H. Li and Q. Zhang,
* "Multiobjective Optimization Problems with C
www.eeworm.com/read/457216/1599671
m maxent.m
% Example 7.2: Maximum entropy distribution
% Section 7.2, Figures 7.2-7.3
% Boyd & Vandenberghe, "Convex Optimization"
% Originally by Lieven Vandenberghe
% Adapted for CVX by Michael Grant 4/11/06
%