Pretraga

Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 306201

Comparison of Heuristic Algorithms for the N-Queen Problem

Martinjak, Ivica; Golub, Marin
Comparison of Heuristic Algorithms for the N-Queen Problem // Proceedings of the 29th International Conference on Information Technology Interfaces , ITI 2007 / Luzar-Stiffler, Vesna ; Hljuz Dobric, Vesna (ur.).
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2007. str. 759-764 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)

CROSBI ID: 306201 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Comparison of Heuristic Algorithms for the N-Queen Problem

Autori
Martinjak, Ivica ; Golub, Marin

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the 29th International Conference on Information Technology Interfaces , ITI 2007 / Luzar-Stiffler, Vesna ; Hljuz Dobric, Vesna - Zagreb : Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2007, 759-764

ISBN
978-953-7138-09-7

Skup
Information Technology Interfaces , ITI 2007

Mjesto i datum
Cavtat, Hrvatska, 25.06.2007. - 28.06.2007

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
n-queen problem; heuristic algorithms; simulated annealing; tabu search; genetic algorithm

Sažetak
This paper addresses the way in which heuristic algorithms can be used to solve the n-queen problem. 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. Due to the reduction of the fitness function complexity to O(1) problem instances with large dimensions are solved.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA

Projekti:
036-0361994-1995 - Univerzalna posrednička platforma za sustave e-učenja (Glavinić, Vlado, MZO ) ( CroRIS)
036-0362980-1921 - Računalne okoline za sveprisutne raspodijeljene sustave (Srbljić, Siniša, MZO ) ( CroRIS)

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Citiraj ovu publikaciju:

Martinjak, Ivica; Golub, Marin
Comparison of Heuristic Algorithms for the N-Queen Problem // Proceedings of the 29th International Conference on Information Technology Interfaces , ITI 2007 / Luzar-Stiffler, Vesna ; Hljuz Dobric, Vesna (ur.).
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2007. str. 759-764 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Martinjak, I. & Golub, M. (2007) Comparison of Heuristic Algorithms for the N-Queen Problem. U: Luzar-Stiffler, V. & Hljuz Dobric, V. (ur.)Proceedings of the 29th International Conference on Information Technology Interfaces , ITI 2007.
@article{article, author = {Martinjak, Ivica and Golub, Marin}, year = {2007}, pages = {759-764}, keywords = {n-queen problem, heuristic algorithms, simulated annealing, tabu search, genetic algorithm}, isbn = {978-953-7138-09-7}, title = {Comparison of Heuristic Algorithms for the N-Queen Problem}, keyword = {n-queen problem, heuristic algorithms, simulated annealing, tabu search, genetic algorithm}, publisher = {Sveu\v{c}ili\v{s}ni ra\v{c}unski centar Sveu\v{c}ili\v{s}ta u Zagrebu (Srce)}, publisherplace = {Cavtat, Hrvatska} }
@article{article, author = {Martinjak, Ivica and Golub, Marin}, year = {2007}, pages = {759-764}, keywords = {n-queen problem, heuristic algorithms, simulated annealing, tabu search, genetic algorithm}, isbn = {978-953-7138-09-7}, title = {Comparison of Heuristic Algorithms for the N-Queen Problem}, keyword = {n-queen problem, heuristic algorithms, simulated annealing, tabu search, genetic algorithm}, publisher = {Sveu\v{c}ili\v{s}ni ra\v{c}unski centar Sveu\v{c}ili\v{s}ta u Zagrebu (Srce)}, publisherplace = {Cavtat, Hrvatska} }

Podijeli:





Contrast
Increase Font
Decrease Font
Dyslexic Font
CROSBI koristi kolačiće (cookies) kako bi poboljšao funkcionalnost stranice.