相 關(guān) 資 源

• The Dynamic Assignment Problem免費(fèi)下載

  資源簡介：The Dynamic Assignment Problem，動態(tài)排班問題，使用到了各個智能算法

  標(biāo)簽： Assignment Dynamic Problem The

  上傳時間： 2013-12-21

  上傳用戶：q123321

• This Assignment requires you to complete The Dynamic drawing components of The Date/Time Control Pan免費(fèi)下載

  資源簡介：This Assignment requires you to complete The Dynamic drawing components of The Date/Time Control Panel from The previous two programming Assignments. In particular, you will be moving The map found in The "Time Zone" tab when The time zone ...

  標(biāo)簽： Assignment components The requires

  上傳時間： 2016-07-03

  上傳用戶：JIUSHICHEN

• The combinatorial core of The OVSF code Assignment Problem that arises in UMTS is to assign some no免費(fèi)下載

  資源簡介：The combinatorial core of The OVSF code Assignment Problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (The code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on Th...

  標(biāo)簽： combinatorial Assignment Problem arises

  上傳時間： 2014-01-19

  上傳用戶：BIBI

• Using Genetic Algorithm to solve The 8 Queens Problem.免費(fèi)下載

  資源簡介：Using Genetic Algorithm to solve The 8 Queens Problem.

  標(biāo)簽： Algorithm Genetic Problem Queens

  上傳時間： 2014-11-28

  上傳用戶：yd19890720

• This program is using Genetic Algorithm to solve The Travlling Salesman Problem. It gives The bes免費(fèi)下載

  資源簡介：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

  上傳時間： 2013-12-06

  上傳用戶：nanfeicui

• solve The 8-puzzle Problem using A* algorithm. Definitely written by my self, also include BGI graph免費(fèi)下載

  資源簡介：solve The 8-puzzle Problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.

  標(biāo)簽： Definitely algorithm Problem include

  上傳時間： 2014-01-17

  上傳用戶：zm7516678

• /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE The SOLUTION OF The INITIAL VALUE Problem: * Y = F免費(fèi)下載

  資源簡介：/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE The SOLUTION OF The INITIAL VALUE Problem: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN The INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTE...

  標(biāo)簽： APPROXIMATE ALGORITHM The SOLUTION

  上傳時間： 2015-08-20

  上傳用戶：zhangliming420

• this m file can Find a (near) optimal solution to The Traveling Salesman Problem (TSP) by setting up免費(fèi)下載

  資源簡介：this m file can Find a (near) optimal solution to The Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for The shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input erro...

  標(biāo)簽： Traveling Salesman solution Problem

  上傳時間： 2013-12-22

  上傳用戶：ruixue198909

• Using The Dynamic Power Management Functionality of The ADSP-BF535 Blackfin® Processor免費(fèi)下載

  資源簡介：Using The Dynamic Power Management Functionality of The ADSP-BF535 Blackfin&reg Processor

  標(biāo)簽： Functionality Management Processor The

  上傳時間： 2015-10-14

  上傳用戶：CSUSheep

• The Josephu wreath Problem solves免費(fèi)下載

  資源簡介：The Josephu wreath Problem solves

  標(biāo)簽： Josephu Problem wreath solves

  上傳時間： 2013-12-20

  上傳用戶：nanshan

• A Genetic Algorithms and The Traveling Salesman Problem免費(fèi)下載

  資源簡介：A Genetic Algorithms and The Traveling Salesman Problem

  標(biāo)簽： Algorithms Traveling Salesman Genetic

  上傳時間： 2015-11-27

  上傳用戶：cccole0605

• Finds a (near) optimal solution to The Traveling Salesman Problem (TSP) by setting up a Genetic Algo免費(fèi)下載

  資源簡介：Finds a (near) optimal solution to The Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for The shortest path (least distance needed to travel to each city exactly once)

  標(biāo)簽： Traveling Salesman solution Problem

  上傳時間： 2013-12-04

  上傳用戶：從此走出陰霾

• 遺傳算法和“貨郎擔(dān)” 問題: "The traveling salesman Problem, or TSP for short, is this: given a finite number of免費(fèi)下載

  資源簡介：遺傳算法和“貨郎擔(dān)” 問題: "The traveling salesman Problem, or TSP for short, is this: given a finite number of cities along with The cost of travel between each pair of Them, find The cheapest way of visiting all The cities and returning ...

  標(biāo)簽： traveling salesman Problem finite

  上傳時間： 2013-12-24

  上傳用戶：watch100

• The main features of The considered identification Problem are that There is no an a priori separati免費(fèi)下載

  資源簡介：The main features of The considered identification Problem are that There is no an a priori separation of The variables into inputs and outputs and The approximation criterion, called misfit, does not depend on The model representation. The...

  標(biāo)簽： identification considered features separati

  上傳時間： 2016-09-20

  上傳用戶：FreeSky

• 用Kruskal算法構(gòu)造最小生成樹解決指派問題（Assignment Problem） 一家公司經(jīng)理準(zhǔn)備安排 名員工去完成 項(xiàng)任務(wù)免費(fèi)下載

  資源簡介：用Kruskal算法構(gòu)造最小生成樹解決指派問題（Assignment Problem） 一家公司經(jīng)理準(zhǔn)備安排 名員工去完成 項(xiàng)任務(wù)，每人一項(xiàng)。由于各員工的特點(diǎn)不同，不同的員工去完成同一項(xiàng)任務(wù)時所獲得的回報是不同的。如何分配工作方案可以使總回報最大？

  標(biāo)簽： Assignment Kruskal Problem 算法

  上傳時間： 2016-09-24

  上傳用戶：hoperingcong

• The power management Problem for wireless sensor networks has been studied intensively. Various app免費(fèi)下載

  資源簡介：The power management Problem for wireless sensor networks has been studied intensively. Various approaches for reducing The energy expenditure have been presented in literature

  標(biāo)簽： intensively management networks wireless

  上傳時間： 2014-01-14

  上傳用戶：924484786

• The power management Problem for wireless sensor networks has been studied intensively. Various app免費(fèi)下載

  資源簡介：The power management Problem for wireless sensor networks has been studied intensively. Various approaches for reducing The energy expenditure have been presented in literature

  標(biāo)簽： intensively management networks wireless

  上傳時間： 2017-03-02

  上傳用戶：it男一枚

• Floyd-wharshall algoritm for The shortest path Problem. I wrote this in C. It s easy to compile and免費(fèi)下載

  資源簡介：Floyd-wharshall algoritm for The shortest path Problem. I wrote this in C. It s easy to compile and work in all *nix like systems.

  標(biāo)簽： C. Floyd-wharshall algoritm shortest

  上傳時間： 2017-04-12

  上傳用戶：123456wh

• descript The Dynamic programming免費(fèi)下載

  資源簡介：descript The Dynamic programming

  標(biāo)簽： programming descript Dynamic The

  上傳時間： 2017-04-12

  上傳用戶：yxgi5

• Proff of The NP-Completeness of The 3-SAT Problem免費(fèi)下載

  資源簡介：Proff of The NP-Completeness of The 3-SAT Problem

  標(biāo)簽： NP-Completeness The Problem Proff

  上傳時間： 2017-04-13

  上傳用戶：czl10052678

• The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks免費(fèi)下載

  資源簡介：The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

  標(biāo)簽： Multi-Hop Protocol Networks Wireless

  上傳時間： 2014-01-19

  上傳用戶：zaizaibang

• Artificial Bee Colony Algorithm Review and Application to Generalized Assignment Problem免費(fèi)下載

  資源簡介：Artificial Bee Colony Algorithm Review and Application to Generalized Assignment Problem

  標(biāo)簽： Application Generalized Artificial Assignment

  上傳時間： 2013-12-17

  上傳用戶：xmsmh

• Designing delivery districts for The vehicle routing Problem with stochastic demands免費(fèi)下載

  資源簡介：Designing delivery districts for The vehicle routing Problem with stochastic demands

  標(biāo)簽： stochastic Designing districts delivery

  上傳時間： 2013-12-13

  上傳用戶：大三三

• Matlab script for solution to The driven cavity Problem on a staggered grid using a divergence formu免費(fèi)下載

  資源簡介：Matlab script for solution to The driven cavity Problem on a staggered grid using a divergence formulation and second-order Runge-Kutta time integration.

  標(biāo)簽： divergence staggered solution Problem

  上傳時間： 2017-05-14

  上傳用戶：lingzhichao

• Matlab script for solution to The driven cavity Problem using The FDS algorithm, which discretizes t免費(fèi)下載

  資源簡介：Matlab script for solution to The driven cavity Problem using The FDS algorithm, which discretizes The Stokes form of The Navier-Stokes equations.

  標(biāo)簽： discretizes algorithm The solution

  上傳時間： 2017-05-14

  上傳用戶：ANRAN

• Genetic Algorithm (GA) based solver for The Traveling Salesman Problem免費(fèi)下載

  資源簡介：Genetic Algorithm (GA) based solver for The Traveling Salesman Problem

  標(biāo)簽： Algorithm Traveling Salesman Genetic

  上傳時間： 2014-01-27

  上傳用戶：siguazgb

• In The rectangle packing Problem, encoding schemes to represent The placements of rectangles are t免費(fèi)下載

  資源簡介：In The rectangle packing Problem, encoding schemes to represent The placements of rectangles are The key factors of efficient algorithms. In 1995, an epoch-making encoding scheme

  標(biāo)簽： placements rectangles The rectangle

  上傳時間： 2017-06-16

  上傳用戶：hn891122

• In The rectangle packing Problem, encoding schemes to represent The placements of rectangles are th免費(fèi)下載

  資源簡介：In The rectangle packing Problem, encoding schemes to represent The placements of rectangles are The key factors determining The efficiency of algorithms. SEQP AIR is one of The most sophisticated encoding sheme, which has been consider...

  標(biāo)簽： placements rectangles The rectangle

  上傳時間： 2013-12-24

  上傳用戶：hphh

• Solving The Vehicle Routing Problem with Genetic Algorithms免費(fèi)下載

  資源簡介：Solving The Vehicle Routing Problem with Genetic Algorithms

  標(biāo)簽： Algorithms Solving Routing Problem

  上傳時間： 2017-07-08

  上傳用戶：coeus

• Solution to The "8 Queens Problem" (8 Damen Problem) known from Chess免費(fèi)下載

  資源簡介：Solution to The "8 Queens Problem" (8 Damen Problem) known from Chess

  標(biāo)簽： Problem Solution Queens Damen

  上傳時間： 2017-08-12

  上傳用戶：894898248