273 uppsatser · sida 11 av 19
… processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two …
En fallstudie på Tarpex
… processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two …
… processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two …
… processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two …
… processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two …
… With regards to the character of the Va?ljarbarometern dataset, three existing algorithms are adapted to detect these outliers. Also, a number of randomly generated observations are added to the data, by all algorithms correctly labelled as outliers. The resulting anomaly scores …
… be differences in the distributional character between categories of words, an algorithm is implemented for classifying words based on the dimensionality data. The classification algorithm is tested for different categories. The result strengthens the thesis that there could …
… baseline query was expanded once automatically using the sense that the Lesk algorithm chose from the Swedish WordNet and once manually by the authors. We compared precision and recall from our baseline with precision and recall from both the automatic and the manual expansions …
… skills?? and ?What has arithmetic looked like in different eras and what algorithms have been used??. Through literature searches in search engines, scientific articles were found, which formed the basis for the result segment. This was divided into two parts: A historical and a …
n this dissertation a comparison of two evolutionary methods for evolving ANNs for robot control is made. The methods compared are SANE with enforced sub-population and delta-coding, and marker-based encoding. In an attempt to speed up evolution, marker-based encoding is …
… puts a sharp bound on the timestep length. In order to keep the transport algorithms stable, the timestep length has to be very small. To avoid too short timesteps, we adopted a new kind of grid. In principle, we defined the global grid on the surface of a cube. By replacing …
… mellan flera punkter är ett så kallat NP-komplett (NP, nondeterministic algorithm in polynominal time) problem vilket innebär att det inte finns någon exakt lösning på problemet som man i dag känner till. Vid val av algoritmer finns det många olika algoritmer som går att använda …
… from unauthorized access cryptography can be applied. The cryptography algorithms in use today all have their pros and cons. They are therefore suited for different applications. We've compared three different cryptography algorithms RSA, DES and IDEA. What we've focused on is …
I detta 10-poängsarbete går jag igenom hur min egenhändigt producerade kvadratrotsalgoritm fungerar praktiskt och teoretiskt. Med denna algoritm kan man för hand räkna ut kvadratrötter som innehåller 50-60 värdesiffror. Med de tidigare kända algoritmerna för kvadratrötter kan …
… factors influencing the path, such as terrain and threats, are included in the algorithm. The results presented in this thesis show that MPC solves the problem. As with every method there are some drawbacks and advantages, but as a summary the method is a very promising one and …
