代码搜索：Best 有哪些应用？

找到约 10,000 项符合「Best 有哪些应用？」的源代码

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

asm gvmat32.asm

; ; gvmat32.asm -- Asm portion of the optimized longest_match for 32 bits x86 ; Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant. ; File written by Gilles Vollant, by modifiying the longest
·
www.eeworm.com/read/128531/5988031

c bond_3ad.c

/* * Copyright(c) 1999 - 2004 Intel Corporation. All rights reserved. * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public Licens
·
www.eeworm.com/read/127439/6005028

asm gvmat32.asm

; ; gvmat32.asm -- Asm portion of the optimized longest_match for 32 bits x86 ; Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant. ; File written by Gilles Vollant, by modifiying the longest
·
www.eeworm.com/read/472938/6306883

m pso2.m

%% Particle Swarm Optimization Simulation % Simulates the movements of a swarm to minimize the objective function % % $$ \left( x-15 \right) ^{2}+ \left( y-20 \right) ^{2} = 0$$ % % The swarm m
·
www.eeworm.com/read/456267/6332178

m pso.m

%% Particle Swarm Optimization Simulation % Simulates the movements of a swarm to minimize the objective function % % $$ \left( x-15 \right) ^{2}+ \left( y-20 \right) ^{2} = 0$$ % % The swarm m
·
www.eeworm.com/read/487628/6506745

c md_low.c

/*! *************************************************************************** * \file md_low.c * * \brief * Main macroblock mode decision functions and helpers * *****************
·
www.eeworm.com/read/487428/6511336

muse p11.muse

#title P11: 背包问题的搜索解法 《背包问题九讲》的本意是将背包问题作为动态规划问题中的一类进行讲解。但鉴于的确有一些背包问题只能用搜索来解，所以这里也对用搜索解背包问题做简单介绍。大部分以01背包为例，其它的应该可以触类旁通。 * 简单的深搜 对于01背包问题，简单的深搜的复杂度是O(2^N)。就是枚举出所有2^N种将物品放入背包的方案，然后找最优解。基本框架如下： ...
·
www.eeworm.com/read/482119/6628047

m ymsga0.m

function [Best0,Gen0,BestF0,AvrF0,gen0]=ymSGA0(m,n,g,op_pre,MM,d,Xlu,O,C,P) [n1,n2]=size(Xlu); BestF0=zeros(); %各代的最优的适应值 AvrF0=zeros(); %各代适应值的平均值 Best0=[]; %最优个体 gen0=0; %寻得最优个体的代数
·
www.eeworm.com/read/480723/6660614

c acotsp.c

/* AAAA CCCC OOOO TTTTTT SSSSS PPPPP AA AA CC OO OO TT SS PP PP AAAAAA CC OO OO TT SSSS PPPPP AA AA CC OO OO TT S
·
www.eeworm.com/read/408362/11391365

txt rfc149.txt

组织：中国互动出版网（http://www.china-pub.com/） RFC文档中文翻译计划（http://www.china-pub.com/compters/emook/aboutemook.htm） E-mail：ouyang@china-pub.com 译者：陈贵敏（efoxxx efoxxx@263.net） 译文发布时间：2001-7-25 版权：本中文翻译文档版权
·