Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - ai
Search - ai - List
DL : 0
1.1 背包问题 有一个徒步旅行者,已知他能承受的旅行背包的重量不超过a(kg)。设有n种物品可供他选择装入背包,这n种物品分别编号为1,2,…,n。其中第i种物品每件的重量为ai(kg),其使用价值(指一件第i种物品对旅行者来说所带来的好处的一种数量指标)为ci(i=1,2,…,n)。问这位旅行者应如何选择携带这n种物品的件数,使得总价值最大? -1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?
Date : 2026-01-10 Size : 13kb User : 孙竟飞

target tracking using kalman
Date : 2026-01-10 Size : 682kb User : Lin

Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi)^+ sum(pi) = Pt By Daniel Perez Palomar (last revision: May 10, 2004).-Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai- bi)^+ sum(pi) = Pt By Daniel Perez Palomar (last revision: May 10, 2004).
Date : 2026-01-10 Size : 1kb User : 马文

DL : 0
C++源代码,递归实现。原问题描述:鼓上蚤时迁到一个山洞里去盗宝,里面有n件宝贝,价值分别是a1,a2......an,并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包,能装的东西最大价值是K,他只能进洞一次,请问他最多能带出多少? 要求:输入K,n,a1,a2......an 输出:他能最多带出的宝物价值 -C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures
Date : 2026-01-10 Size : 1kb User : shubin

DL : 0

Date : 2026-01-10 Size : 6kb User : 龙伯华

DL : 0
电液伺服系统的智能控制研究.kdh,优秀硕士论文-Electro-hydraulic Servo System Intelligent Control. Kdh, outstanding master' s thesis
Date : 2026-01-10 Size : 352kb User : george

基于规则模型的多目标演化算法,作者周爱民与张青复。-Rule-based model of multi-objective evolutionary algorithm, the author Zhang Ai-Min Zhou and rehabilitation.
Date : 2026-01-10 Size : 11kb User : 木心月

DL : 0
实现了免疫算法求解约束优化问题的实例。实验表明,算法具有良好的性能。-The method is the implementation of Immune Algorithm(GA). The experiment results show that the efficiency of the algorithm is better.
Date : 2026-01-10 Size : 667kb User : 花自飘零

DL : 0
Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing -Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing
Date : 2026-01-10 Size : 5kb User : bouhouiaabdeslam

DL : 0
Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing ok -Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing ok
Date : 2026-01-10 Size : 16kb User : bouhouiaabdeslam

Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing -Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing
Date : 2026-01-10 Size : 22kb User : bouhouiaabdeslam

DL : 0
Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing -Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing
Date : 2026-01-10 Size : 66kb User : bouhouiaabdeslam

DL : 0
Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing -Salam Des toolbox que j’ai les télécharger depuis qlq année titre se traitement de signal ou bient signal processing
Date : 2026-01-10 Size : 18kb User : bouhouiaabdeslam

về matlab, sẽ hữ u ích vớ i ai mớ i họ c. thank-về matlab, sẽ hữ u ích vớ i ai mớ i họ c. thank
Date : 2026-01-10 Size : 4.75mb User : quang huy

DL : 0
笛卡儿乘积是以有序偶为元素组成的集合,对给定的集合A和B,求笛卡儿乘积,只需取尽由集合A的元素及集合B的元素,并构成序偶<ai,bj>送入C之中即可。-Cartesian product even as the elements in an orderly set of a given set A and B, seeking Cartesian product, simply take to do by the collection A collection of elements and the elements of B and constitutes a sequence duality " ai, bj> being sent to C can be.
Date : 2026-01-10 Size : 1kb User : ma

差异演化算法的MATLAB程序,程序说明非常详尽,AI研究者必备-Differential evolution algorithm, Matlab
Date : 2026-01-10 Size : 14kb User : LEVIN

Estimates the articulation index, AI, based on the paper by French and Steinberg (1946).All inputs - Estimates the articulation index, AI, based on the paper by French and Steinberg (1946).All inputs
Date : 2026-01-10 Size : 6kb User : tttzhang97

DL : 0
This code implements the search algorithms described in [1]. The code only contains the Dirichlet/Multinomial case, but the Gaussian case can be hacked in in about 5 minutes. [1] Fast search for Dirichlet process mixture models Conference on AI and Statistics (2007)
Date : 2026-01-10 Size : 6kb User : naarkhoo

Sohrab Jelvehgar AI eBook2nd edition Spring 2009 www.iranmeet.com
Date : 2026-01-10 Size : 6.27mb User : jamshidi

资料可以直接运行,是matlab源码,实现了AI领域常见的手写字符MNIST数据集的识别,一般都是python做,matlab实现的很少,就算有也经常报错,因此这里是提供了例程以及数据集!数据集也是matlab能直接读取的MNIST格式!下载这个资料连数据集都不用单独下载了,节省时间。(The data can be run directly. It is the source code of MATLAB. It realizes the recognition of MNIST data set, which is a common handwritten character in AI field. Generally, it is done by python. There are few matlab implementations, and even if there is one, it often reports an error. So here is the routine and data set! Data set is also the MNIST format that MATLAB can read directly! Download this data set without downloading it separately, saving time.)
Date : 2026-01-10 Size : 11.1mb User : 速度阿萨德飞
« 12 3 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.