代码搜索：Optimizing

找到约 845 项符合「Optimizing」的源代码

代码结果 845
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/233448/4683982

c 20020503-1.c

/* PR target/6542 This testcase caused ICE on SPARC because the function uses no registers after optimizing, so even if -mflat make all registers not permitted for leaf functions, the functio
·
www.eeworm.com/read/190666/5179392

c 20020503-1.c

/* PR target/6542 This testcase caused ICE on SPARC because the function uses no registers after optimizing, so even if -mflat make all registers not permitted for leaf functions, the functio
·
www.eeworm.com/read/340665/3280233

c 20020503-1.c

/* PR target/6542 This testcase caused ICE on SPARC because the function uses no registers after optimizing, so even if -mflat make all registers not permitted for leaf functions, the functio
·
www.eeworm.com/read/324136/3505432

c tkwingdi.c

/* * tkWinGdi.c -- * * implements checking of gdicalls and optimizing SelectObjects * * Copyright (c) Brueckner & Jarosch Ing.GmbH,Erfurt,Germany 1997 * hacked by Leo * * See the file "license
·
www.eeworm.com/read/440906/1781877

c 20020503-1.c

/* PR target/6542 This testcase caused ICE on SPARC because the function uses no registers after optimizing, so even if -mflat make all registers not permitted for leaf functions, the functio
·
www.eeworm.com/read/366702/2881041

c 20020503-1.c

/* PR target/6542 This testcase caused ICE on SPARC because the function uses no registers after optimizing, so even if -mflat make all registers not permitted for leaf functions, the functio
·
www.eeworm.com/read/184464/9099779

m gae.m

%Genetic Algorithm with the Elitist Selection & Crossover--GAESC,optimizing Needle-in-a Haystack function function GAESC() clear all; clc; NC=2000; %Max iteration generation POPSIZE=100;
·
www.eeworm.com/read/425106/10381683

shortestpathsedge

Shortest Paths with Edge Metrics. In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths wit
·
www.eeworm.com/read/494302/6381970

m gae.m

%Genetic Algorithm with the Elitist Selection & Crossover--GAESC,optimizing Needle-in-a Haystack function function GAESC() clear all; clc; NC=2000; %Max iteration generation POPSIZE=100;
·
www.eeworm.com/read/432906/1886855

h ssdt_tpm.h

/* * * Intel ACPI Component Architecture * ASL Optimizing Compiler version 20060707 [Dec 30 2006] * Copyright (C) 2000 - 2006 Intel Corporation * Supports ACPI Specification Revision 3.0a * *
·