Tìm thấy 15+ kết quả cho từ khóa "Evolutionary Computation"
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
Philosophical Transactions of the Royal Society of London – Series B:. computation: a survey, Proceedings of the 4th IEEE Conference Evolutionary Computation, pp. The time and space complexity of the algorithm is O(exp(i. Given a partial assignment of the first p variables x p =(x 1. Unfeasible solutions are eliminated at each stage of the algorithm.. In (Craenen et al., 2003) a comparison of the best evolutionary algorithms is given..
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
In: Proceedings of the Genetic and Evolutionary Computation conference, pp. In: Proceedings of the IEEE. x j is the realization of the jth random variable. where max(O 1inf (x)) is the maximum of the objective function values at the current population in the infeasible region, v j (x) is the violation magnitude of the jth constraint.. The probability p F of the failure event D F as defined by Eq.
document.pdf
repository.vnu.edu.vn Xem trực tuyến Tải xuống
Dasgupta, Revisiting negative selection algorithms, Evolutionary Computation 15 (2007) 223–. Harafi, Detectors generation using genetic algorithm for a negative selection inspired anomaly network intrusion detection system, in: Proceedings of the FedCSIS’2012, 2012, pp. Ji, Negative selection algorithms: from the thymus to v-detector, Ph.D. Perelson, Using genetic algorithms to explore pattern recognition in the immune system, Evolutionary Computation 1 (1993) 191–211..
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
A Modified Swarm Optimizer, Proceedings of the IEEE International Conference of Evolutionary Computation, pp. As the structure of the designed method (see Fig. Flowchart of the whole designed method. The drawback of this method is the correct determination of the threshold. Labeling of the identified blobs in the input binary image. minimum dimensions of the visual objects from the first captured scene and the criteria remain set
000000255072.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
Các phương pháp giải gần đúng thường dùng là: các thuật toán tìm kiếm cục bộ (local search), các sơ đồ xấp xỉ (approximation schemes), các phương pháp xác xuất (probabilistic methods), tính toán tiến hóa (evolutionary computation), thuật toán di truyền (genetic algorithm. Mục đích nghiên cứu, đối tượng, phạm vi nghiên cứu.
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
The computation steps of the proposed algorithm in the simulation system can be summarized as:. objective function g = h //g is the index of the global best G End if. The Anatomy of the Grid: Enabling Scalable Virtual Organizations. A discrete binary version of the particle swarm algorithm. Proceedings of the IEEE Congress on Evolutionary Computation, pp. (2007) to iteratively update the selection probabilities of the selected resources. Figure8 shows another aspect of the workflows.
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
Medical data mining using evolutionary computation. Geatz.DATA MINING A TUTORIAL-BASED PRIMER.. DATA MINING Introductory and Advanced Topics. Data mining applications in healthcare. Healthcare and data mining. Data Warehouse and the Deployment of Data Mining Process. Data mining: application to the Leishmaniasis
000000253580.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
Các phương pháp giải gần đúng thường dùng là: các thuật toán xấp xỉ (approximation schemes), tìm kiếm cục bộ (local search), các phương pháp xác xuất (probabilistic methods), tính toán tiến hóa (evolutionary computation), thuật toán di truyền (genetic algorithm. Luận văn này tập trung vào xây dựng thuật toán di truyền lai để giải bài toán cây khung truyền thông tối ưu (Optimal Communication Spanning Tree - OCST).
repository.vnu.edu.vn Xem trực tuyến Tải xuống
Computer and System Science (DIST), Computer Vision Laboratory, Via Opera Pia 13-16145 Genoa, Italy (page 262) of Face Recognition from Theory and Applications.. [11] Jeffrey Huang, Chengjun Liu, và Harry Wechsler, Eye Detection and Face Recognition Using Evolutionary Computation, Department of Computer Science, George Mason University, http://www.chagall.gmu.edu/ (page 348) of Face Recognition from Theory and Applications..
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
The computational complexity of the NI-combined crossover is O(n 2. 5.1 Effect of the proposed TSP solving method. 5.2 Applicability of the proposed solving method. of the 1st IEEE Conference on Evolutionary Computation, pp. The rest of the chapter is organized as follows. The division of the network. Flowchart of the proposed method. TSP is one of the combinatorial optimization problems. A Theoretical Investigation into the Performance of the Hopfield Model.
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
Proceedings of the IEEE Congress on Evolutionary Computation, pp. A discrete version of particle swarm optimization for flowshop scheduling problems. Particle swarm optimization for task assignment problem. A hybrid particle swarm optimization for job shop scheduling problem
000000254140.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
Algorithm Giải thuật tiến hóa EC Evolutionary Computation Tính toán tiến hóa GA Genetic Algorithm Giải thuật di truyền LB Link-Biased Encoding Mã hóa thiên kiến cạnh LNB Link-Node Biased Encoding Mã hóa thiên kiến cạnh và nút MRCT Minimum Routing-Cost Spanning Tree Cây khung giá định tuyến cực tiểu NB Node-Biased Encoding Mã hóa thiên kiến nút NetKey Network Random Key Encoding Mã hóa khóa ngẫu nhiên NST Nhiễm Sắc Thể OCST Optimal Communication Spanning Tree Cây khung truyền thông tối ưu PROCT Product-Requirement
000000232109.pdf.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
Giải thuật phỏng bầy kiến giải bài toỏn k-median. 53 4.1 Một số định nghĩa. 54 4.3 Lưu đồ thuật toỏn. 57 4.3.5 Nguyờn tắc chung của thuật toỏn. 58 4.3.6 Điều kiện dừng của thuật toỏn. 64 5.2.2 Cỏc kết quả tớnh toỏn. 75 5.3.1 Đỏnh giỏ về chất lượng thuật toỏn. 81 6CÁC THUẬT NGỮ VIẾT TẮT EC Evolutionary Computation Cỏc tớnh toỏn phỏng sinh học EA Evolutionary Algorithm Cỏc thuật toỏn phỏng sinh học ACO Ant Colony Optimize Bài toỏn tối ưu phỏng bầy kiến AS Ant System Hệ thống phỏng bầy kiến GA Genetic
repository.vnu.edu.vn Xem trực tuyến Tải xuống
GA with Priority Rules for Solving Job- Shop Scheduling Problems", Evolutionary Computation, CEC 2008 (IEEE World Congress on Computational Intelligence), pp. A Heuristic Approach for Large Scale Job Shop Scheduling Problems", Journal of Applied Sciences Vol. Kewei Yang Knowledge-based ant colony optimization for the flexible job shop scheduling problems", Dynamics of Continuous, Discrete and Impulsive Systems, Series B:.
000000297142.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
Jeffrey Huang, Chengjun Liu, và Harry Wechsler đề xuất thuật toán căn cứ trên tính tiến hóa (Evolutionary computation) và di truyền (Genetic) cho các tác vụ nhận dạng khuôn mặt. Daniel Bgraham và Nigel M Allinson sử dụng phƣơng pháp đƣợc gọi là tạo bản sao không gian đặc trƣng để biểu diễn và nhận dạng hƣớng di chuyển của khuôn mặt. Guodong Guo, Stan Z.Li, Kap Luk Chan dùng phƣơng pháp SVM để nhận dạng khuôn mặt.
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
According to the progress of computers, we can use a large scale of computation for artificial intelligence based on the model of natural sciences. Moreover, the number of computers on the Internet has grown like hotcakes, we obtain another choice for grid computing. There is possibility of high performance grid computing for artificial intelligence than cluster system in the present time..
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
To simulate the incompressible flow in complex three-dimensional geom- etry efficiently and accurately, a solver based on solution of the Navier-Stokes equa- tions in the generalized curvilinear coordinate system was developed. The convective terms are differenced using a flux difference splitting approach. The viscous terms are differenced using second-order accurate central dif- ferences. The problem of coupling changes in the...
tainguyenso.vnu.edu.vn Xem trực tuyến Tải xuống
In Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing, Washington DC, USA, pp. He is a member of IACSIT and also member of the editorial board of the International Journal of Engineering and Technology (IJET). Nguyen Dinh Hoa is an associate professor and vice director of the Information Technology Institute, VNU. He is member of the organizing committees of many prestigious national conferences since 1998.
chiasemoi.com Xem trực tuyến Tải xuống
Many scholars have studied how the development of language is related to the evolutionary development of the human species. One evolutionary step may have resulted in the development of a. The human brain has specialized functions in each of its two hemispheres. Those functions which are analyic, such as tool-using and language, are largely confi+ed to the left hemisphere of the brain. ",.,x:xT.t1";:Lff};wi:ti:?3'irr r,,,.
000000139971-2.pdf
dlib.hust.edu.vn Xem trực tuyến Tải xuống
A constant computation time is due to the fact that the recurrence relationsin Eqs.(3.45)and(3.46)do not depend on the kernel orders and there is no need for thepre-computation of GPCET radial kernel of any order as in the ZM’sq-recursive strategy.The “purely” recursive computation of radial and angular kernels is a distinct characteristicof harmonic function-based methods.Taking recursiveOne as the selected strategy for recursive fast computation of GPCET kernels,recursive computation of GPCET kernels