default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian Satja Kurdija
Person information
- affiliation: University of Zagreb, Croatia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Igor Begic, Adrian Satja Kurdija, Jadranko Matusko:
A Framework for 5G Network Slicing Optimization with Path Protection. MIPRO 2024: 742-747- [c10]Stjepan Pozgaj, Adrian Satja Kurdija, Marin Silic, Goran Delac, Klemo Vladimir:
An Overview of the State-of-the-Art Machine Learning Methods for Traveling Salesman Problem. MIPRO 2024: 844-849 - 2023
- [j14]Matej Mihelcic
, Adrian Satja Kurdija:
On the complexity of redescription mining. Theor. Comput. Sci. 944: 113673 (2023) - 2022
- [j13]Lucija Sikic, Adrian Satja Kurdija, Klemo Vladimir, Marin Silic:
Graph Neural Network for Source Code Defect Prediction. IEEE Access 10: 10402-10415 (2022) - [j12]Helena Ceovic, Adrian Satja Kurdija, Goran Delac, Marin Silic:
Named Entity Recognition for Addresses: An Empirical Study. IEEE Access 10: 42094-42106 (2022) - [j11]Adrian Satja Kurdija, Marin Silic, Goran Delac, Klemo Vladimir:
Distributed multi-user QoS-aware service selection. Int. J. Web Grid Serv. 18(4): 411-436 (2022) - [j10]Adrian Satja Kurdija, Marin Silic, Goran Delac, Klemo Vladimir:
Fast Multi-Criteria Service Selection for Multi-User Composite Applications. IEEE Trans. Serv. Comput. 15(1): 174-187 (2022) - 2021
- [j9]Lucija Sikic, Petar Afric, Adrian Satja Kurdija, Marin Silic:
Improving Software Defect Prediction by Aggregated Change Metrics. IEEE Access 9: 19391-19411 (2021) - [j8]Davor Vukadin, Adrian Satja Kurdija, Goran Delac, Marin Silic:
Information Extraction From Free-Form CV Documents in Multiple Languages. IEEE Access 9: 84559-84575 (2021) - 2020
- [b1]Adrian Satja Kurdija:
A probabilistic quality of service model for nondeterministic service compositions. ; Vjerojatnosni model kvalitete usluge za nedeterminističke kompozicije usluga. University of Zagreb, Croatia, 2020 - [j7]Darko Sinanovic, Gordan Sisul, Adrian Satja Kurdija, Zeljko Ilic:
Multiple transmit antennas for low PAPR spatial modulation in SC-FDMA: single vs. multiple streams. EURASIP J. Wirel. Commun. Netw. 2020(1): 44 (2020) - [j6]Petar Afric, Lucija Sikic, Adrian Satja Kurdija, Marin Silic:
REPD: Source code defect prediction as anomaly detection. J. Syst. Softw. 168: 110641 (2020) - [c9]Adrian Satja Kurdija, Petar Afric, Lucija Sikic, Boris Plejic, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
Building Vector Representations for Candidates and Projects in a CV Recommender System. AIMS 2020: 17-29 - [c8]Adrian Satja Kurdija, Petar Afric, Lucija Sikic, Boris Plejic, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
Candidate Classification and Skill Recommendation in a CV Recommender System. AIMS 2020: 30-44
2010 – 2019
- 2019
- [c7]Petar Afric, Adrian Satja Kurdija, Lucija Sikic, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
Population-Based Variable Neighborhood Descent for Discrete Optimization. AIMS 2019: 1-12 - [c6]Petar Afric, Adrian Satja Kurdija, Lucija Sikic, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
GRASP Method for Vehicle Routing with Delivery Place Selection. AIMS 2019: 72-83 - [c5]Luka Tadic, Petar Afric, Lucija Sikic, Adrian Satja Kurdija, Vladimir Klemo, Goran Delac, Marin Silic:
Analysis and Comparison of Exact and Approximate Bin Packing Algorithms. MIPRO 2019: 919-924 - [c4]Mislav Pozek, Lucija Sikic, Petar Afric, Adrian Satja Kurdija, Klemo Vladimir, Goran Delac, Marin Silic:
Performance of Common Classifiers on node2vec Network Representations. MIPRO 2019: 925-930 - [c3]Petar Afric, Lucija Sikic, Adrian Satja Kurdija, Goran Delac, Marin Silic:
REPD: Source Code Defect Prediction As Anomaly Detection. QRS Companion 2019: 227-234 - 2018
- [j5]Adrian Satja Kurdija, Marin Silic, Sinisa Srbljic:
Real-time adaptive QoS prediction using approximate matrix multiplication. Int. J. Web Grid Serv. 14(2): 200-235 (2018) - [j4]Adrian Satja Kurdija, Marin Silic, Klemo Vladimir, Goran Delac:
Efficient global correlation measures for a collaborative filtering dataset. Knowl. Based Syst. 147: 36-42 (2018) - [c2]Adrian Satja Kurdija, Marin Silic, Goran Delac, Klemo Vladimir, Sinisa Srbljic:
Efficient Multi-user Service Selection Based on the Transportation Problem. ICWS 2018: 507-515 - 2017
- [j3]Lavoslav Caklovic, Adrian Satja Kurdija:
A universal voting system based on the Potential Method. Eur. J. Oper. Res. 259(2): 677-688 (2017) - [c1]Andrea Drmic, Marin Silic, Goran Delac, Klemo Vladimir, Adrian Satja Kurdija:
Evaluating robustness of perceptual image hashing algorithms. MIPRO 2017: 995-1000 - 2016
- [j2]Adrian Satja Kurdija, Marin Smiljanic, Zeljko Ilic:
A chunk and power allocation algorithm for proportional fairness in OFDMA relay networks. Wirel. Networks 22(8): 2741-2751 (2016) - 2012
- [j1]Adrian Satja Kurdija, Zeljko Ilic, Gordan Sisul:
Unequal-Slot Based Data Rate Maximization Algorithm for Multiuser OFDMA Systems. IEEE Commun. Lett. 16(5): 682-684 (2012)
Coauthor Index
aka: Vladimir Klemo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
