Essays about: "theoretical computer science"

Showing result 21 - 25 of 39 essays containing the words theoretical computer science.

1. 21. Approximation of Max-Cut on Graphs of Bounded Degree

   University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

   Author : Mikael Florén; [2016]
   Keywords : Theoretical Computer Science; Graphs; Algorithms; Max Cut; Approximation; Teoretisk Datalogi; Grafer; Algoritmer; Max Cut; Approximation;

   Abstract : The Max-Cut problem is a well-known NP-hard problem, for which numerous approximation algorithms have been developed over the years. In this thesis, we examine the special case where the degree of vertices in the graph is bounded. READ MORE

3. 22. Distributed Graph Mining : A study of performance advantages in distributed data mining paradigms when processing graphs using PageRank on a single node cluster

   University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

   Author : Alan Abdlwafa; Henrik Edman; [2015]
   Keywords : ;

   Abstract : Distributed data mining is a relatively new area within computer science that is steadily growing, emerging from the demands of being able to gather and process various distributed data by utilising clusters. This report presents the properties of graph structured data and what paradigms to use for efficiently processing the data type, based on comprehensive theoretical studies applied on practical tests performed on a single node cluster. READ MORE

4. 23. Calculation of global properties of a multi-layered solid wood structure using Finite Element Analysis

   University essay from Uppsala universitet/Tillämpad mekanik

   Author : Guillermo Zafra-Camón; [2015]
   Keywords : finite elements; wood mechanics; homogenization of solids; multi-layered solid;

   Abstract : Finite Element Method (FEM) is a powerful numerical tool which, combined with the fast development of Computer Science in the lastdecades, had made possible to perform mechanical analysis of a widerange of bodies and boundary conditions. However, the complexity of some cases may turn the calculationprocess too slow and sometimes even unaffordable for most computers. READ MORE

5. 24. Randomized word-parallel algorithms for detection of small induced subgraphs

   University essay from Lunds universitet/Institutionen för datavetenskap

   Author : David Larsson; Antonina Tokarchuk; [2015]
   Keywords : induced subgraph detection; word parallelism; randomization; Monte Carlo algorithms; practical approach; benchmarking; master’s thesis; Technology and Engineering; Mathematics and Statistics;

   Abstract : Induced subgraph detection is a widely studied set of problems in theoretical computer science, with applications in e.g. social networks, molecular biology and other domains that use graph representations. READ MORE

6. 25. Algorithm Construction for Efficient Scheduling of Advanced Health Care at Home

   University essay from KTH/Skolan för teknik och hälsa (STH)

   Author : Tonima Afroze; Moa Rosén Gardell; [2015]
   Keywords : advanced health care at home; home assistance; vehicle routing problem; time windows; scheduling; rescheduling; routing; optimization; avancerad sjukvård i hemmet; hemtjänst; schemaläggning; omplanering; ruttoptimering; optimering;

   Abstract : Providing advanced health care at home rather than in a hospital creates a greater quality of life for patients and their families. It also lowers the risk of hospital-acquired infections and accelerates recovery. The overall cost of care per patient is decreased. READ MORE