Sökning: "dynamic algorithm"

Visar resultat 36 - 40 av 396 avhandlingar innehållade orden dynamic algorithm.

1. 36. Parallelization of dynamic algorithms for electronic structure calculations

   Författare :Anton G. Artemov; Emanuel H. Rubensson; Maya Neytcheva; Bo Kågström; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; parallelization; task-based programming; matrix algorithms; sparse matrices; inverse factorization; localized computations; density matrix methods; electronic structure calculations; Scientific Computing; Beräkningsvetenskap;

   Sammanfattning : The aim of electronic structure calculations is to simulate behavior of complex materials by resolving interactions between electrons and nuclei in atoms at the level of quantum mechanics. Progress in the field allows to reduce the computational complexity of the solution methods to linear so that the computational time scales proportionally to the size of the physical system. LÄS MER

3. 37. Two-Level Multi-Objective Genetic Algorithm for Risk-Based Life Cycle Cost Analysis

   Författare :Yamur K. Al-Douri; Uday Kumar; Jan Lundberg; Hussan Hamodi; Ahmed Al-Dubai; Luleå tekniska universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Artificial intelligence AI ; Life cycle cost LCC ; Machine learning ML ; Multi-objective genetic algorithm MOGA ; Risk-based life cycle cost LCC ; Tunnel fans; Two-level system; Operation and Maintenance Engineering; Drift och underhållsteknik;

   Sammanfattning : Artificial intelligence (AI) is one of the fields in science and engineering and encompasses a wide variety of subfields, ranging from general areas (learning and perception) to specific topics, such as mathematical theorems. AI and, specifically, multi-objective genetic algorithms (MOGAs) for risk-based life cycle cost (LCC) analysis should be performed to estimate the optimal replacement time of tunnel fan systems, with a view towards reducing the ownership cost and the risk cost and increasing company profitability from an economic point of view. LÄS MER

4. 38. Enhancing Differential Evolution Algorithm for Solving Continuous Optimization Problems

   Författare :Miguel Leon; Ning Xiong; Yigen Zenlander; Peter Funk; Ronnie Johansson; Mälardalens högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; datavetenskap;

   Sammanfattning : Differential Evolution (DE) has become one of the most important metaheuristics during the recent years, obtaining attractive results in solving many engineering optimization problems. However, the performance of DE is not always strong when seeking optimal solutions. It has two major problems in real world applications. LÄS MER

5. 39. Spectrum Sensing for Dynamic Spectrum Access in Cognitive Radio

   Författare :Inna Valieva; Dag Stranneby; Mälardalens universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : Abstract. The number of mobile devices is constantly growing, and the exclusivestatic spectrum allocation approach is leading to the spectrum scarcity problem whensome of the licensed bands are heavily occupied and others are nearly unused.Spectrum sharing and opportunistic spectrum access allow achieving more efficientspectrum utilization. LÄS MER

7. 40. Efficient Temporal Reasoning with Uncertainty

   Författare :Mikael Nilsson; Patrick Doherty; Jonas Kvarnström; Félix Ingrand; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Temporal Reasoning; Dynamic Controllability; Simple Temporal Network with Uncertainty; Incremental Algorithms; Temporal Networks;

   Sammanfattning : Automated Planning is an active area within Artificial Intelligence. With the help of computers we can quickly find good plans in complicated problem domains, such as planning for search and rescue after a natural disaster. When planning in realistic domains the exact duration of an action generally cannot be predicted in advance. LÄS MER