代码搜索：optimization

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/385453/2592071

sources

!if "$(BSP_NOCS8900)" == "1" SKIPBUILD=1 !endif TARGETNAME=cs8900 RELEASETYPE=PLATFORM TARGETTYPE=DYNLINK DLLENTRY=DllEntry ###MSC_OPTIMIZATION=/Ox /Fc TARGETLIBS=
·
www.eeworm.com/read/385230/2594033

sources

!if "$(BSP_NOCS8900)" == "1" SKIPBUILD=1 !endif TARGETNAME=cs8900 RELEASETYPE=PLATFORM TARGETTYPE=DYNLINK DLLENTRY=DllEntry ###MSC_OPTIMIZATION=/Ox /Fc TARGETLIBS=
·
www.eeworm.com/read/375190/2731552

hpp x86_fast_rounding_control.hpp

/* Boost interval/detail/x86gcc_rounding_control.hpp file * * This header provides a rounding control policy * that avoids flushing results to memory. In * order for this optimization to be reliab
·
www.eeworm.com/read/375190/2738837

qbk poisson_optimisation.qbk

[sect:optim Optimisation Examples} [h4 Poisson Distribution - Optimization and Accuracy is quite complicated. The general formula for calculating the CDF uses the incomplete gamma thus: return ga
·
www.eeworm.com/read/373026/2767623

m ex_4_3.m

% Exercise 4.3: Solve a simple QP with inequality constraints % From Boyd & Vandenberghe, "Convex Optimization" % Jo雔le Skaf - 09/26/05 % % Solves the following QP with inequality constraints: %
·
www.eeworm.com/read/373026/2767632

m fig6_6.m

% Example 6.3: Optimal input design % Section 6.3.2, Figure 6.6 % Boyd & Vandenberghe "Convex Optimization" % Original by Lieven Vandenberghe % Adapted for CVX by Joelle Skaf - 09/26/05 % % Consider a
·
www.eeworm.com/read/373026/2767643

m fig6_20.m

% Example 6.8: Spline fitting % Section 6.5.3, Figure 6.20 % Boyd & Vandenberghe "Convex Optimization" % Original by Lieven Vandenberghe % Adapted for CVX by Joelle Skaf - 10/03/05 % (a figure is gene
·
www.eeworm.com/read/373026/2767662

m floor_plan.m

% Floor planning % Section 8.8.1/2, Example 8.7, Boyd & Vandenberghe "Convex Optimization" % Original by Lieven Vandenberghe % Adapted for CVX by Joelle Skaf - 11/13/05 % (a figure is generated) % % R
·
www.eeworm.com/read/373026/2767664

m separate_pt_poly.m

% Section 8.1.1: Separating a point from a polyhedron % Boyd & Vandenberghe "Convex Optimization" % Joelle Skaf - 10/09/05 % % The goal is to produce a hyperplane separating x0 and the polyhedron % de
·
www.eeworm.com/read/373026/2767666

m ex_8_3.m

% Example 8.3: Bounding correlation coefficients % Boyd & Vandenberghe "Convex Optimization" % Joelle Skaf - 10/09/05 % % Let C be a correlation matrix. Given lower and upper bounds on % some of the a
·