ANT COLONY OPTIMIZATION ALGORITHM

Tìm thấy 2,059 tài liệu liên quan tới từ khóa "ANT COLONY OPTIMIZATION ALGORITHM":

ANT COLONY OPTIMIZATION METHODS AND APPLICATIONS pot

ANT COLONY OPTIMIZATION METHODS AND APPLICATIONS POT

Direction of arrival estimation has turned out to be a substantial part of many applications like channel characterization, car tracking (Danneville et al., 2005), source localization in radar and sonar (Godara, 2002), receiver algorithm design and co-channel interference reduction (Christ[r]

352 Đọc thêm

Áp dụng thuật toán ACO vào việc giải các bài toán tối ưu trong sinh học phân tử

ÁP DỤNG THUẬT TOÁN ACO VÀO VIỆC GIẢI CÁC BÀI TOÁN TỐI ƯU TRONG SINH HỌC PHÂN TỬ

Optimization problems in molecular biology is one of the most investigated fields in computer science today; one notable case is the prediction of RNA structures by optimizing algorithms. ACO (Ant Colony Optimization) algorithm is th[r]

8 Đọc thêm

SỬ DỤNG KỸ THUẬT TÍNH TOÁN MỀM DỰ ĐOÁN CẤU TRÚC BẬC HAI CỦA RNA

SỬ DỤNG KỸ THUẬT TÍNH TOÁN MỀM DỰ ĐOÁN CẤU TRÚC BẬC HAI CỦA RNA

Bài viết trình bày các kết quả nghiên cứu về việc sử dụng thuật toán ACO (Ant Colony Optimization) đã cải tiến để dự đoán cấu trúc bậc hai RNA, đồng thời đưa ra hướng nghiên cứu tiếp theo cần giải quyết.

8 Đọc thêm

Báo cáo hóa học: " Research Article A Joint Optimization Criterion for Blind DS-CDMA Detection" pot

BÁO CÁO HÓA HỌC RESEARCH ARTICLE A JOINT OPTIMIZATION CRITERION FOR BLIND DS CDMA DETECTION POT

_4.2._ _ALGORITHM DERIVED FROM A JOINT_ _OPTIMIZATION CRITERION_ We have seen that the inverse filter criterion solves the prob-lem of blind source extraction by using a contrast functio[r]

11 Đọc thêm

GOLDSMITH PAPER

GOLDSMITH PAPER

Standard interior point methods have complexity that is cubic with respect to the dimensionality of the input space (i.e., with respect to
K , the number of users), due to the complexity of the inner Newton iterations [2]. The minimax-based approach in [8] also has complexity that is cubic in K be[r]

11 Đọc thêm

Báo cáo hóa học: " Research Article Optimal Multiuser MIMO Linear Precoding with LMMSE Receiver" doc

BÁO CÁO HÓA HỌC: " RESEARCH ARTICLE OPTIMAL MULTIUSER MIMO LINEAR PRECODING WITH LMMSE RECEIVER" DOC

From the simulation results, it is clear that the proposed MU-MIMO linear precoding with LMMSE detection based on particle swarm optimization scheme outperforms the BD algorithm and the [r]

10 Đọc thêm

Báo cáo hóa học: " A Network of Kalman Filters for MAI and ISI Compensation in a Non-Gaussian Environment Bessem Sayadi" doc

BÁO CÁO HÓA HỌC A NETWORK OF KALMAN FILTERS FOR MAI AND ISI COMPENSATION IN A NON GAUSSIAN ENVIRONMENT BESSEM SAYADI DOC

NETWORK OF KALMAN FILTERS BASED ON THE LIKELIHOOD RATIO TEST: DETECTION ALGORITHM For the optimization of the proposed receiver, we propose to incorporate a decision feedback assuming th[r]

14 Đọc thêm

SAS/ETS 9.22 User''''s Guide 19 pptx

SAS ETS 9 22 USER''''S GUIDE 19 PPTX

TABLE 6.3 Optimization Techniques Algorithm TECH= trust region Method TRUREG Newton-Raphson method with line search NEWRAP Newton-Raphson method with ridging NRRIDG quasi-Newton methods [r]

10 Đọc thêm

Báo cáo hóa học: "Image and video quality improvement techniques for emerging applications" doc

BÁO CÁO HÓA HỌC: "IMAGE AND VIDEO QUALITY IMPROVEMENT TECHNIQUES FOR EMERGING APPLICATIONS" DOC

In addition to image and video processing algorithm optimization using different image quality metrics, the image/video enhancement and analysis for 3D visualization plays an important r[r]

9 Đọc thêm

báo cáo hóa học:" Image and video quality improvement techniques for emerging applications" docx

BÁO CÁO HÓA HỌC:" IMAGE AND VIDEO QUALITY IMPROVEMENT TECHNIQUES FOR EMERGING APPLICATIONS" DOCX

In addition to image and video processing algorithm optimization using different image quality metrics, the image/video enhancement and analysis for 3D visualization plays an important r[r]

9 Đọc thêm

ON SOLVING MULTIOBJECTIVE BIN PACKING PROBLEMS USING EVOLUTIONARY PARTICLE SWARM OPTIMIZATION

ON SOLVING MULTIOBJECTIVE BIN PACKING PROBLEMS USING EVOLUTIONARY PARTICLE SWARM OPTIMIZATION

To solve MOBPP-2D problems, a multiobjective evolutionary particle swarm optimization algorithm MOEPSO is proposed.. Without the need of combining both objectives into a composite scalar[r]

26 Đọc thêm

20 INTLAB global optimazation software pal & scendes

20 INTLAB GLOBAL OPTIMAZATION SOFTWARE PAL & SCENDES

The algorithm implemented in MATLAB that uses the INTLAB package supporting interval calculations and automatic differentiation solves the bound con-strained global optimization problem.[r]

10 Đọc thêm

CONVERGENCE ANALYSIS OF A PROXIMAL POINT ALGORITHM FOR MINIMIZING DIFFERENCES OF FUNCTIONS

CONVERGENCE ANALYSIS OF A PROXIMAL POINT ALGORITHM FOR MINIMIZING DIFFERENCES OF FUNCTIONS

Abstract. Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A progress to go beyond convexity was made by considering the class of functions represent[r]

23 Đọc thêm

Phương pháp tối ưu đàn kiến giải bài toán lập lịch sản xuất

PHƯƠNG PHÁP TỐI ƯU ĐÀN KIẾN GIẢI BÀI TOÁN LẬP LỊCH SẢN XUẤT

multicommodity flow problems , SIAM Journal on Computing 5(4), 1976, pp 691-703.
[13] W.J. Gutjahr. ACO Algorithms with guaranteed convergence to the optimal
solution problem , Info.Processing Lett., vol.83, no.3, 2002, pp 145-153.
[14] Hoang Xuan Huan & Dinh Trung Hoang.[r]

12 Đọc thêm

Báo cáo hóa học: "Editorial Optimization Techniques in Wireless Communications" docx

BÁO CÁO HÓA HỌC: "EDITORIAL OPTIMIZATION TECHNIQUES IN WIRELESS COMMUNICATIONS" DOCX

Over the last few years, convex optimization has found a place among the most useful techniques for algorithm design and analysis of wireless communication systems, and has become a stan[r]

2 Đọc thêm

Báo cáo khoa học: "Optimization in Coreference Resolution Is Not Needed: A Nearly-Optimal Algorithm with Intensional Constraints" ppt

BÁO CÁO KHOA HỌC: "OPTIMIZATION IN COREFERENCE RESOLUTION IS NOT NEEDED: A NEARLY-OPTIMAL ALGORITHM WITH INTENSIONAL CONSTRAINTS" PPT

TRANG 1 Proceedings of the 12th Conference of the European Chapter of the ACL, pages 442–450, OPTIMIZATION IN COREFERENCE RESOLUTION IS NOT NEEDED: A NEARLY-OPTIMAL ALGORITHM WITH INTENS[r]

9 Đọc thêm

Báo cáo hóa học: " Research Article Flexible Triangle Search Algorithm for Block-Based Motion Estimation" pptx

BÁO CÁO HÓA HỌC: " RESEARCH ARTICLE FLEXIBLE TRIANGLE SEARCH ALGORITHM FOR BLOCK-BASED MOTION ESTIMATION" PPTX

The use of the well-known sim-plex optimization algorithm for finding the minimum SAD is motivated by the fact that the simplex technique has the capacity to quickly change search direct[r]

14 Đọc thêm

Báo cáo hóa học: " Research Article Downlink Resource Allocation for Autonomous Infrastructure-based Multihop Cellular Networks" pdf

BÁO CÁO HÓA HỌC: " RESEARCH ARTICLE DOWNLINK RESOURCE ALLOCATION FOR AUTONOMOUS INFRASTRUCTURE-BASED MULTIHOP CELLULAR NETWORKS" PDF

In fact, the output of the proposed algorithm is the joint optimization of the routing path, and base-station selection to achieve the maximum total throughput in the system, which in co[r]

14 Đọc thêm

Multidisciplinary design optimization for aircraft wing using response surface method, genetic algorithm, and simulated annealing

Multidisciplinary design optimization for aircraft wing using response surface method, genetic algorithm, and simulated annealing

5. Conclusions
This research is motivated by our interest in developing and improving computational capability of MDO system. Considerable MDO work was successfully performed for a tested wing to validate several suggested algorithms that can be easily applied for more complex and practical proble[r]

Đọc thêm

Báo cáo hóa học: " Research Article Adaptive Coordinated Reception for Multicell MIMO Uplink" docx

BÁO CÁO HÓA HỌC: " RESEARCH ARTICLE ADAPTIVE COORDINATED RECEPTION FOR MULTICELL MIMO UPLINK" DOCX

The MTP problem with adaptive MBS selection can be also solved by using the iterative optimization algorithm, where at each iteration the power vector is updated by P[_t_+1]_=m_P[_t_]_._[r]

11 Đọc thêm