Annealing algorithm

Xem 1-11 trên 11 kết quả Annealing algorithm
  • Báo cáo khoa học để tài "Thuật toán luyện kim song song (Parallel Simulated Annealing Algorithms) giải quyết bài toán Max sat" được nghiên cứu với các nội dung: Tổng quan thuật toán mô phỏng luyện kim (Simulated Annealing = SA), xây dựng khung thuật toán SA, ứng dụng của thuật toán SA. Để nắm vững hơn nội dung kiến thức bài báo cáo mời các bạn cùng tham khảo tài liệu.

    doc33p hienque 01-10-2016 3 2   Download

  • Tham khảo sách 'thuật toán luyện kim song song (parallel simulated annealing algorithms) giải quyết bài toán max-sat', tài liệu phổ thông, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

    pdf41p buddy8 13-07-2011 105 37   Download

  • This book presents state of the art contributes to Simulated Annealing (SA) that is a well-known probabilistic meta-heuristic. It is used to solve discrete and continuous optimization problems. The significant advantage of SA over other solution methods has made it a practical solution method for solving complex optimization problems. Book is consisted of 13 chapters, classified in single and multiple objectives applications and it provides the reader with the knowledge of SA and several applications.

    pdf0p cucdai_1 19-10-2012 20 6   Download

  • Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appealing alternative to the ExpectationMaximization algorithm (Dempster et al., 1977).

    pdf8p bunbo_1 17-04-2013 19 2   Download

  • Optimization is important in all branches of engineering due to limited resources available. Through optimization, maximum usage of the resource can be achieved. However, global optimization can be difficult due to the requirement of the knowledge of the system behavior under analysis and the possible large solution space. Without this knowledge, the optimization thus obtained may only be a local optimization. Metaheuristic algorithms, on the other hand, are effective in exploring the solution space....

    pdf428p bi_bi1 11-07-2012 34 5   Download

  • Other than this, automation and optimization of production engineering was attempted in various fields. Okumoto et al. (2005D) optimized the block allocation on the assembly area using simulated annealing method. Wibisono et al. (2007) optimized block division planning using genetic algorithm and product model. Universal Shipbuilding Corporation (2008) developed a high performance NC Printing Machine, which enables fast printing irrespective of the number of characters and lines to be printed.

    pdf64p quynho77 13-11-2012 21 5   Download

  • Simulated annealing has been applied to a wide range of problems: combinatorial and continuous optimizations. This work approaches a new class of problems in which the objective function is discrete but the parameters are continuous. This type of problem arises in rotational irregular packing problems. It is necessary to place multiple items inside a container such that there is no collision between the items, while minimizing the items occupied area. A feedback is proposed to control the next candidate probability distribution, in order to increase the number of accepted solutions.

    pdf194p maket1311 16-10-2012 9 1   Download

  • Local search is a family of general-purpose techniques for search and optimization problems. Chapter 5: Local Search provides about Local search basics; General local search algorithm; Hill-climbing; Tabu search; Simulated Annealing; WSAT; Conclusions

    ppt42p cocacola_10 08-12-2015 4 0   Download

  • The growing interest in the application of artificial intelligence (AI) techniques to power system engineering has introduced the potentials of using this state-of-the-art technology. AI techniques, unlike strict mathematical methods, have the apparent ability to adapt to nonlinearities and discontinuities commonly found in power systems. The best-known algorithms in this class include evolution programming, genetic algorithms, simulated annealing, tabu search, and neural networks. In the last three decades many papers on these applications have been published.

    pdf0p nguyenthai_thinh 16-03-2013 32 16   Download

  • Process planning represents the link between engineering design and shop floor manufacturing.

    pdf27p nguyen3 13-11-2009 68 11   Download

  • Web search engine: Markov chain theory Data Mining, Machine Learning: Data mining, Machine learning: Stochastic gradient, Markov chain Monte Carlo, Image processing: Markov random fields, Design of wireless communication systems: random matrix theory, Optimization of engineering processes: simulated annealing, genetic algorithms, Finance (option pricing, volatility models): Monte Carlo, dynamic models, Design of atomic bomb (Los Alamos): Markov chain Monte Carlo.

    pdf16p quangchien2205 30-03-2011 33 4   Download

Đồng bộ tài khoản