diplomski-rad-vpriscan · Project · Project · Details · Activity · Cycle Analytics · Repository · Repository · Files · Commits · Branches · Tags · Contributors · Graph . en (fer); Arhitektura računala 2: hr, en (fer, fer-en); Skriptni jezici: (fer); Seminar: hr (fer, fer-d); Projekt: hr (fer, fer-d); Završni rad: hr (fer); Diplomski rad: hr (fer-d). Neslužbeni FER reddit. Dragi svi, ako ste muško i imate 18 godina ili više, molila bih vas da mi ispunite ovaj upitnik za diplomski rad. Trebaju mi muški.

Author: Kazrajind Tegrel
Country: Bahamas
Language: English (Spanish)
Genre: Photos
Published (Last): 7 October 2014
Pages: 225
PDF File Size: 14.5 Mb
ePub File Size: 20.21 Mb
ISBN: 892-6-56932-711-5
Downloads: 37388
Price: Free* [*Free Regsitration Required]
Uploader: Vudokasa

Heuristic Search for additional papers on this topic. Due to the reduction of the fitness function complexity to O 1 problem instances with dilpomski dimensions are solved. Croatian Download 8MB Preview.

Globalni paralelni genetski algoritam, diplomski rad, http: Igrec, Bojan Svjetlovodni senzor za mjerenje vibracija. Complexity of n-Queens Completion Ian P. A structural solution for the sensor was designed according to overall results.

Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek

The prototype was made using 3D printing technology and its images can be seen in penultimate chapter of this paper. Skip to search form Skip to main content.


References Publications referenced by this paper. More information and software credits. Showing of 23 extracted citations. Nema podataka za dohvacanje citata.

Downloads Downloads per month over past year. Text Bojan Igrec – Diplomski rad – Svjetlovodni senzor za mjerenje vibracija.

Završni i diplomski rad

Metaheuristics for algorithm simulated annealing, tabu search and genetic algorithm are shown, test results are demonstrated and upper bound complexity is determined. Landscape analysis and efficient metaheuristics for solving the n-queens problem Ellips MasehianHossein AkbaripourNasrin Mohabbati-Kalejahi Comp. Finally, effect of drag from the surrounding air on vibrations of the membrane was investigated using computational fluid dynamics CFD.

The computed amplitude is then used as input data in further calculations of mechanical vibrations. This thesis deals with the conceptual design and prototype development of a fiber optic sensor ciplomski measuring vibrations.

Additionally, preliminary dimensions of the sensor were established at this stage. Showing of 6 references. Genetic algorithm Metaheuristic Fitness function. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

In addition, numerical simulations of the problem carried out in commercial software ger ZEMAX licensed to FER were used to confirm the accuracy of optical analytical calculations. Using the program code, various implementations of sensor and their different vibrating modes were examined on the basis of optical calculations data.


Topics Discussed in This Paper. The developed program code is based on analytical mathematical models, which are also elaborated within rsd thesis. This paper has 32 citations. Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm Ellips MasehianHossein AkbaripourNasrin Mohabbati-Kalejahi Int. The efficiencies of algorithms are compared and their achievements are measured.

Citations Publications citing this paper. This paper addresses the way in which heuristic algorithms can be used to solve the n-queen problem. As part of the thesis, a specific program code was developed in MATLAB software package in order to optimize the mechanical components of fiber optic raf.

The paper contains a detailed description of the design and the accompanying manufacturing sheets and drawings.

Dejan Skvorc – Navodi Google znalca

Computational complexity theory Addresses publication format. From This Paper Figures, tables, and topics from this paper. Heuristic Simulated annealing Tabu search.