Sökresultat:
178 Uppsatser om Algorithms - Sida 9 av 12
C, C++, Java och Python : En prestandajämförelse mellan fyra programmeringsspråk
In today?s society computers are getting a much more important role. To get a computer to work as intended it has to be programmed. A computer program is written with programming languages. There is an abundance of programming languages available today and there are many differences and similarities between them.
C, C++, Java och Python - En prestandajämförelse mellan fyra programmeringsspråk
In today?s society computers are getting a much more important role. To get a
computer to work
as intended it has to be programmed. A computer program is written with
programming
languages.
There is an abundance of programming languages available today and there are
many
differences and similarities between them. The different languages have their
advantages and
their disadvantages where some of them are intended for fast performance, some
to be cheap
on memory usage, and some are developed to be easy to program on.
In our thesis we have chosen to compare four of todays most common languages,
C, C++, Java
and Python.
Realistisk restidsberäkning för comodal reseplanering
With increasing traffic congestion problems in bigger cities, it is becoming more and more important to provide the traveller with correct information about all transport alternatives. When doing that, the traveller gets the opportunity to make the best decision based on the current traffic situation. Instead of traditional travel planners, where public and private transport modes are presented separately, the co-modal travel planner offers a combination. In order to make the comparison correct and fair, the travel times have to be estimated realistically and on equal basis. This master thesis focuses on how to estimate travel times in the city of Stockholm for journeys by cars, public transport, bicycles and also for walking.An investigation of the available data on maps and travel times shows where the currently used methods are lacking.
AI för Hive
Strategies for the board game Hive was implemented and evaluated in this project. The report covers the rules as well as the system that was implemented in order to build strategies. The strategies are evaluated based on how they perform against each other. Two search Algorithms were implemented: Minmax and Alpha-Beta Pruning. Alpha-Beta with depth 4 had the best performance against other strategies as well as in individual tests..
Optimal Yatzy : Kan den optimala algoritmen optimeras?
Yahtzee is a game based on luck. Yet there are Algorithms designed to give an optimal result and succeeds in doing so. This report compares the end result of an optimal algorithm to an algorithm that has been modified for the multiplayer scenario. The modified algorithm tries to win over the optimal algorithm through taking greater risks in its decisions when falling behind in points. The results show that it is not favorable to do so.
Studie av konstruktion och implementering av CORDIC-algoritmer
Abstract CORDIC (Coordinate Rotation Digital Computer) is an iterative algorithm for the calculation of a two-dimensional vector in circular, linear or hyperbolic coordinate systems. This paper presents a survey of known CORDIC Algorithms and architectures for the rotation and vectoring mode in the circular cordinate system. In addition an implementation of the differential CORDIC algorithm in VHDL has been done. The implementation is designed to keep the fast timing and throughput characteristic known for on-line redundant arithmetic..
Stereoseende i realtid
In this thesis, two real-time stereo methods have been implemented and evaluated. The first one is based on blockmatching and the second one is based on local phase. The goal was to be able to run the Algorithms at real-time and examine which one is best. The blockmatching method performed better than the phase based method, both in speed and accuracy. SIMD operations (Single Instruction Multiple Data) have been used in the processor giving a speed boost by a factor of two..
En topologisk representation av en polygon;det rakkantiga skelettet
The aim of this thesis project is to produce an algorithm for finding a topologicalrepresentation of a polygon, called a straight skeleton, using floating pointarithmetic. Various straight skeleton Algorithms are examined and discussed witha focus on time complexity and one is chosen for implementation. This implementationis then compared with the open source library CGAL with regards torunning time. The result is an algorithm which is based on an algorithm by Felkeland Obdrzalek and which, for polygons with more than five thousand vertices andthree significant digits representing points, runs around 25% faster than CGALsimplementation. Complications regarding the use of floating-point arithmetic arealso discussed..
GPGPU : Bildbehandling på grafikkort
GPGPU is a collective term for research involving general computation on graphics cards. A modern graphics card typically provides more than ten times the computational power of an ordinary PC processor. This is a result of the high demands for speed and image quality in computer games.This thesis investigates the possibility of exploiting this computational power for image processing purposes. Three well known methods where implemented on a graphics card: FFT (Fast Fourier Transform), KLT (Kanade Lucas Tomasi point tracking) and the generation of scale pyramids. All Algorithms where successfully implemented and they are tree to ten times faster than correspondning optimized CPU implementation..
Implementation & utvärdering av spelmotor i WebGL
This report describes an analysis of WebGL together with JavaScript with the aim to examine its limitations, strengths and weaknesses. This analysis was performed by building a 2D game engine containing some dynamic elements such as water, smoke, fire, light, and more. Different Algorithms have been tested and analyzed to provide a clearer picture of how these work together. The report will go through the most basic functions of the game engine and describe briefly how these work.The result shows that JavaScript with WebGL can be considered to be a potent toolsets, despite the difficulties caused by JavaScript.In summary, similar projects can be recommended as Javascript and WebGL proved both fun and incredibly rewarding to work with..
Perceptuell identifiering av musikgenre
This is a study in the field of Music Information Retrieval (MIR) concerning classification of musicgenre. The study uses a music listening experiment and machine learning methods to determinewhether or not the drum sounds from different songs contain sufficient information to classifygenre.MIR methods are used to extract data from the audio signals. The data is used together with theclassification results of the listening experiment to train different machine learning Algorithms toclassify the songs in different genres.The results indicate that using only drum sounds for genre classifications works well, both forlisteners and for machine learning methods..
Vem räknar vad och hur? : En studie av gymnasiematematiken i yrkeslivet
This thesis tries to describe the use of mathematics in some workplace tasks. In particular the math corresponding to subjects of high school math courses B, C and D, is identified. Furthermore, the study attempts to analyze the nature of the way in which this math comes to use. This is represented by six different competences. Interviews with five (5) professionals, within different areas, are the main sources of information for this study.
Den rätta känlslan : Om den grafiska formgivarens nödvändighet och förhållande till prosatext
The right touch is a project investigating the necessity of the graphic designer in relation to prose text.The project is partly theoretical and partly practical. A series of interviews with graphic designers, publishers and writers has been conducted to discuss the relationship between content and form in prose. In addition to these interviews, I have done theoretical research on the historical, political and economical context of the designed prose. Based on the findings during the theoretical research, a series of practical experiments was also executed. This project has had several outcomes but one of the more noteworthy is two methods for challenging the references in the act of designing prose (choosing a typeface, for example) using Algorithms.
Masskattning av tunga fordon i realtid genom systemidentifiering
As trucks are getting more and more advanced, information about their weight has become a key factor for controlling them in a more fuel efficient and safe manner. Knowing the mass of a heavy duty vehicle in real time has been a difficult challenge for the truck manufacturers. With the processing power for electronic control units in trucks steadily increasing, more advanced Algorithms for calculating the mass has been developed, but at the moment there still is a wish for better performance.Since there is a lack of good information regarding the external forces acting on the vehicle, forces that depends on the slope of the road, foundation of the road and the wind, the methods have to be able to disregard these. Such an approach, based on an indirect least square solution, has been evaluated in this thesis. The results have been promising and based on these a recommendation about further evaluation has been made..
Bildförbättring över en bildsekvens
When SKL (Swedish National Laboratory of Forensic Science) gets images to analyse, the task often is to identify a person or an object. In that work it?s important to find features. Unfortunately images from camera surveillances often contain a lot of noise, so details can be hard to discern.A simple method to improve an image from a sequence is to compute the mean of some of the images. However, the part of interest in the image has to be in the same position in all images.