Sökning: "multi-objective optimization"
Visar resultat 6 - 10 av 98 uppsatser innehållade orden multi-objective optimization.
6. Automatic icon placement approach for improved association & walkability on city wayfinding maps
Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapSammanfattning : With the evolution of cartography from hand-drawn to digital maps, the task of icon placement has become increasingly complex. Nowadays there is a need to automate this process to produce high quality results in less time. LÄS MER
7. Reproducibility and Applicability of a Fuzzy-based Routing Algorithm in Wireless Sensor Networks
Kandidat-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskapSammanfattning : Wireless sensor networks is a broad subject with many applications and interesting research areas, such as optimization within connectivity and energy efficiency. One problem is that most published articles in this field use customized simulation environments and do not provide source code of their implementation. LÄS MER
8. Manufacturing Knowledge Management Using a Virtual Factory-Based Ontology Implemented in a Graph Database
Magister-uppsats, Högskolan i Skövde/Institutionen för ingenjörsvetenskapSammanfattning : Ontology-based technologies like Semantic Web and Knowledge Graphs are promising for knowledge management in manufacturing industries. In the literature there are abundant of publications related to using ontologies to represent and capture knowledge in manufacturing. LÄS MER
9. Access Point Selection and Clustering Methods with Minimal Switching for Green Cell-Free Massive MIMO Networks
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : As a novel beyond fifth-generation (5G) concept, cell-free massive MIMO (multiple-input multiple-output) recently has become a promising physical-layer technology where an enormous number of distributed access points (APs), coordinated by a central processing unit (CPU), cooperate to coherently serve a large number of user equipments (UEs) in the same time/frequency resource. However, denser AP deployment in cell-free networks as well as an exponentially growing number of mobile UEs lead to higher power consumption. LÄS MER
10. Discrete Flower Pollination Algorithm for the Graph Coloring Problem
Kandidat-uppsats, KTH/DatavetenskapSammanfattning : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. LÄS MER