DIPLOMSKI RAD FER PDF

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: Dabei Vujinn
Country: Puerto Rico
Language: English (Spanish)
Genre: Literature
Published (Last): 20 October 2007
Pages: 316
PDF File Size: 9.12 Mb
ePub File Size: 9.4 Mb
ISBN: 739-8-32903-286-3
Downloads: 67106
Price: Free* [*Free Regsitration Required]
Uploader: Tygot

Fakultet elektrotehnike i računarstva

In addition, numerical simulations of the problem carried out in commercial diplommski package ZEMAX licensed to FER were used to confirm the accuracy of optical analytical calculations. This paper has 32 citations. More information and software credits. Finally, effect of drag from the surrounding air on vibrations of the membrane was investigated using computational fluid dynamics CFD.

Metaheuristics for algorithm simulated annealing, tabu search and genetic algorithm are shown, test results are demonstrated and upper bound complexity is determined. The efficiencies of algorithms are compared and their achievements are measured. Croatian Download 8MB Preview. Showing of 23 extracted citations. From This Paper Figures, tables, and topics from this paper. This paper addresses the way in which heuristic algorithms can be used dplomski solve the n-queen problem. Computational complexity theory Addresses publication format.

  ESSENTIALS OF MEDICAL PHYSIOLOGY BY SEMBULINGAM PDF

Nema podataka za dohvacanje citata. Heuristic Search for additional papers on this topic. Additionally, preliminary dimensions of the sensor were established at diplpmski stage. This thesis deals with the conceptual design and prototype development of a fiber optic sensor for measuring vibrations. Genetic algorithm Metaheuristic Fitness function.

Globalni paralelni genetski algoritam, diplomski rad, http: Text Bojan Igrec – Diplomski rad – Downloads Downloads per month over past year. Skip to search form Skip to main content. A structural solution for the sensor was designed according to overall results.

Mrežne stranice Siniše Šegvića

The paper contains a detailed description of the design and the accompanying manufacturing sheets and drawings. Landscape analysis and efficient metaheuristics for solving the n-queens problem Ellips MasehianHossein AkbaripourNasrin Mohabbati-Kalejahi Comp.

Heuristic Simulated annealing Tabu search.

Due to the reduction of the fitness function complexity to O 1 problem instances with large dimensions are solved. The prototype was made using 3D printing technology and its images can be seen in penultimate chapter of this paper.

  DIARIO DE VIAJE ALEXANDRA DAVID-NEEL PDF

Showing of 6 references. Igrec, Bojan Svjetlovodni senzor za mjerenje vibracija. The developed program code is based on analytical mathematical models, which are also elaborated within this thesis.

The computed amplitude is then used as input data in further calculations of mechanical vibrations. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. Svjetlovodni senzor za mjerenje vibracija. Citations Publications citing this paper.

Topics Discussed in This Paper.

Siniša Šegvić

Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm Ellips MasehianHossein AkbaripourNasrin Mohabbati-Kalejahi Int. 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 sensor.

Using the program code, various implementations of sensor and their different vibrating modes were examined on the basis of optical calculations data. Complexity of n-Queens Completion Ian P. References Publications referenced by this paper.