亚洲综合专区,黄网动漫久久久,brazzers在线观看

Problem-SolvIng

連續型粒子群算法的java實現

連續型粒子群算法的java實現，可以自己設計粒子群算法（繼承Swarm和Particle類），包含有三個個抽象類（Swarm、Particle、Problem），可以繼承Problem類自定義新的問題。

標簽： java 粒子群算法

上傳時間： 2014-01-19

上傳用戶：3到15
This code can be used to model a microstrip line or a microstrip patch antenna (the particular prob

This code can be used to model a microstrip line or a microstrip patch antenna (the particular problem being modeled is determined at compile-time via various declarations).

標簽： microstrip particular antenna model

上傳時間： 2013-12-31

上傳用戶：wpt
Polynomial fit functions === === === === RegressionObject.cls contains a class that provides an

Polynomial fit functions === === === === RegressionObject.cls contains a class that provides an easy way to add polynomial regression functionality to any application. If you just want linear regression or a very high degree, no matter: this class has good performance and scales seamlessly with the complexity of your problem.

標簽： RegressionObject Polynomial functions contains

上傳時間： 2015-04-06

上傳用戶：rocwangdp
《Fuzzy Relational Calculus Toolbox, Rel.1.01》The toolbox provides functions and original algorithms

《Fuzzy Relational Calculus Toolbox, Rel.1.01》The toolbox provides functions and original algorithms for solving direct and inverse problems. Author: Yordan Kyosev & Ketty Peeva

標簽： Relational algorithms functions Calculus

上傳時間： 2015-04-18

上傳用戶：royzhangsz
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA)

物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes

標簽： location location-allocation Continuous alternate

上傳時間： 2015-05-17

上傳用戶：kikye
Exceptional C++ shows by example how to go about sound software engineering in standard C++. Do you

Exceptional C++ shows by example how to go about sound software engineering in standard C++. Do you enjoy solving thorny C++ problems and puzzles

標簽： Exceptional engineering software standard

上傳時間： 2015-05-25

上傳用戶：changeboy
There are some 79 or so Matlab files here which will help in many aspects of the computer vision str

There are some 79 or so Matlab files here which will help in many aspects of the computer vision structure from motion problem, a full description is provided in the manual, torrsam.ps.

標簽： computer aspects Matlab vision

上傳時間： 2014-01-02

上傳用戶：xlcky
WebServices_WebSphere_Version_5 Objectives § Web Services Overview • What are Web Services?

WebServices_WebSphere_Version_5 Objectives § Web Services Overview • What are Web Services? • Roles and Functions of Web Services § Web Services Runtime • Base Support • IBM WebSphere UDDI Registry (Private UDDI) • Web Services Gateway (WSGW) § Problem Determination § Web Services Security § Technical Previews § Summary

標簽： Services WebServices_WebSphere_Version Objectives Web

上傳時間： 2015-06-15

上傳用戶：cx111111
This is SvmFu, a package for training and testing support vector machines (SVMs). It s written in C

This is SvmFu, a package for training and testing support vector machines (SVMs). It s written in C++. It uses templates. The advantage of templates is that the types of kernel values and data points can be varied to suit the problem.

標簽： machines training package testing

上傳時間： 2015-07-03

上傳用戶：zhengzg
A program to demonstrate the optimization process of ant colony optimization for the traveling salem

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.

標簽： optimization demonstrate the traveling

上傳時間： 2015-07-12

上傳用戶：偷心的海盜