代码搜索：optimization

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

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

m contents.m

% SeDuMi 1.1 (May 2005) % Toolbox for optimization over self-dual homogeneous cones. % % This file is part of SeDuMi 1.1 by Imre Polik and Oleksandr Romanko % Copyright (C) 2005 McMaster Univers
·
www.eeworm.com/read/385462/2590243

c check_gcctorture_pr28634-1.c

/* PR rtl-optimization/28634. On targets with delayed branches, dbr_schedule could do the next iteration's addition in the branch delay slot, then subtract the value again if the branch wasn
·
www.eeworm.com/read/385462/2590249

c check_gcctorture_pr28634.c

/* PR rtl-optimization/28634. On targets with delayed branches, dbr_schedule could do the next iteration's addition in the branch delay slot, then subtract the value again if the branch wasn
·
www.eeworm.com/read/374482/2750589

properties guiresources.properties

# ProGuard -- shrinking, optimization, and obfuscation of Java class files. # Copyright (c) 2002-2007 Eric Lafortune (eric@graphics.cornell.edu) # # Tab names. # proGuardTab = ProGuard inputOutpu
·
www.eeworm.com/read/373026/2767619

m ex_4_5.m

% Exercise 4.5: Show the equivalence of 3 convex problem formations % From Boyd & Vandenberghe, "Convex Optimization" % Jo雔le Skaf - 08/17/05 % % Shows the equivalence of the following 3 problems: % 1
·
www.eeworm.com/read/373026/2767628

m ex_4_27.m

% Exercise 4.27: Matrix fractional minimization using second-order cone programming % From Boyd & Vandenberghe, "Convex Optimization" % Jo雔le Skaf - 09/26/05 % % Shows the equivalence of the following
·
www.eeworm.com/read/373026/2767630

m fastest_mixing_mc.m

% Section 4.6.3: Find the fastest mixing Markov chain on a graph % Boyd & Vandenberghe "Convex Optimization" % Jo雔le Skaf - 09/26/05 % % The 'fastest mixing Markov chain problem' is to find a transiti
·
www.eeworm.com/read/373026/2767631

m cantilever_beam.m

% Exercise 4.31: Design of a cantilever beam (GP) % Boyd & Vandenberghe "Convex Optimization" % Almir Mutapcic - 01/30/06 % Updated to use GP mode 02/08/06 % (a figure is generated) % % We have
·
www.eeworm.com/read/373026/2767648

m ex_5_39.m

% Exercise 5.39: SDP relaxations of the two-way partitioning problem % Boyd & Vandenberghe. "Convex Optimization" % Jo雔le Skaf - 09/07/05 % (a figure is generated) % % Compares the optimal values of:
·
www.eeworm.com/read/373026/2767661

m floor_plan_graphs.m

% Solve a floor planning problem given graphs H & V % Section 8.8.1/2, Example 8.7, Boyd & Vandenberghe "Convex Optimization" % Joelle Skaf - 11/13/05 % (a figure is generated) % % Rectangles aligned
·