代码搜索:optimization

找到约 10,000 项符合「optimization」的源代码

代码结果 10,000
www.eeworm.com/read/440906/1782115

c 20031009-1.c

/* PR optimization/12510 */ /* Origin: Lars Skovlund */ /* Reduced testcase by Volker Reichelt */ /* Verify that one splitting pass is not missing
www.eeworm.com/read/440906/1782290

c overflow-1.c

/* PR optimization/13318 */ /* Origin: */ /* Reduced testcase: Wolfgang Bangerth */ /* Verify that the big multiplier doesn't cause an integer overflow in th
www.eeworm.com/read/440906/1782436

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/440906/1782586

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/425567/2004779

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/425562/2005363

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/411933/2179225

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/401534/2339787

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/396844/2406640

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/396844/2406664

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