裝箱問題：在裝箱問題中，有若干個(gè)容量為c 的箱子和n 個(gè)待裝載入箱子中的物品。物品i 需占 用s[i]個(gè)單元（0< s[i]≤c）。成功裝載是指能把所有物品都裝入箱子。最優(yōu)裝載是指使用最 少箱子的成功裝載。 例如某運(yùn)輸公司要把包裹裝入卡車中，每個(gè)包裹都有一定的重量，且每輛卡車也有其載 重限制（假設(shè)每輛卡車的載重都一樣）。在卡車裝載問題中，希望用最少的卡車來裝載包裹。 此問題可看作裝箱問題。卡車對(duì)應(yīng)于箱子，包裹對(duì)應(yīng)于物品。 解裝箱問題的BEST Fit 算法： 設(shè)avail[i]為箱子i 的可用容量。 初始時(shí)，所有箱子的可用容量為c 。 選擇物品i放入具有最小avail且容量大于s[i]的箱子中。
標(biāo)簽：
上傳時(shí)間： 2015-05-22
上傳用戶：yan2267246
good morning,my dear teachers,my dear professors.i am very glad to be here for your interview.my name is song yonghao,i am 22 years old .i come from luoyang,a very beautiful aicent city.my undergratuade period will be accomplished in changan university in july ,2004 and now,i am trying my BEST for o
標(biāo)簽： dear professors interview my
上傳時(shí)間： 2015-05-24
上傳用戶：shus521
代碼名稱： Snitz Forums 2000 代碼語言： 英文 代碼類型： 國外代碼 運(yùn)行環(huán)境： ASP 授權(quán)方式： 免費(fèi)代碼 代碼大小： 530kb 代碼等級(jí)： 3 整理時(shí)間： 2006-3-15 16:42:00 聯(lián) 系 人： 開 發(fā) 商： 演示地址： 簡(jiǎn) 介： Snitz Forums 2000, one of the BEST ASP based bulletin board systems on the market. Getting better every day! A complete board system (forum) that allows the user access to a friendly and intuitive interface. Snitz Forums 2000 v3.4.05 [74]
標(biāo)簽： 代碼 Forums Snitz 2000
上傳時(shí)間： 2015-06-03
上傳用戶：caixiaoxu26
清華JAVA教程。不用多說了吧，good、better、BEST
上傳時(shí)間： 2015-06-25
上傳用戶：皇族傳媒
使用pso求最小化一函數(shù) matlab程式碼，寫的非常簡(jiǎn)潔(不到100行)，且還包括了2維的圖形展示，和大家分享參考!!! 一起學(xué)習(xí)matlab和各種optimize methods 最小化：(x-15)^2+(y-20)^2 The swarm matrix is swarm(index, [location, velocity, BEST position, BEST value], [x, y components or the value component]) Author: Wesam ELSHAMY (wesamelshamy@yahoo.com) MSc Student, Electrical Enginering Dept., Faculty of Engineering Cairo University, Egypt
上傳時(shí)間： 2013-12-18
上傳用戶：zhaiye
This book focuses on combining C++ s power and flexibility with high performance and scalability, resulting in the BEST of both worlds. Specific topics include temporary objects, memory management, templates, inheritance, virtual functions, inlining, referencecounting, STL, and much more
標(biāo)簽： flexibility performance scalability and
上傳時(shí)間： 2015-07-02
上傳用戶：784533221
This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the BEST path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
標(biāo)簽： Algorithm Travlling the Salesman
上傳時(shí)間： 2013-12-06
上傳用戶：nanfeicui
Introducing a new product requires the designer to think about the product differentiators. Designing a user-friendly product, considering all other features are equivalent, will help increase the product acceptance and sales. A good User Interface is definitively one of these differentiators. In many instances, a Graphical User Interface (GUI) is the BEST approach.
標(biāo)簽： product differentiators Introducing the
上傳時(shí)間： 2015-07-04
上傳用戶：cx111111
RW - Read & Write utility, for hardware engineers, firmware (BIOS) engineers, driver developers, QA engineers, performance test engineers, diagnostic engineers, etc., This utility access almost all the computer hardware, including PCI (PCI Express), PCI Index/Data, Memory, Memory Index/Data, I/O Space, I/O Index/Data, Super I/O, Clock Generator, DIMM SPD, SMBus Device, CPU MSR Registers, ATA/ATAPI Identify Data, ACPI Tables Dump (include AML decode), Embedded Controller, USB Information and LPT Remote Access. And also an Command Window is provided to access hardware manually. Website1: http://rw.net-forces.com/ Website2: http://home.kimo.com.tw/ckimchan.tw/ Website3: http://jacky5488.myweb.hinet.net/ For BEST view, please change the screen resolution to 1024 x 768 (or above) pixels.
標(biāo)簽： engineers developers firmware hardware
上傳時(shí)間： 2013-12-22
上傳用戶：王楚楚
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently BEST found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the traveling
上傳時(shí)間： 2015-07-12
上傳用戶：偷心的海盜
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
