default search action
Mladen Nikolic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i17]Momir Adzemovic, Predrag Tadic, Andrija Petrovic, Mladen Nikolic:
Beyond Kalman Filters: Deep Learning-Based Filters for Improved Object Tracking. CoRR abs/2402.09865 (2024) - [i16]Momir Adzemovic, Predrag Tadic, Andrija Petrovic, Mladen Nikolic:
Engineering an Efficient Object Tracker for Non-Linear Motion. CoRR abs/2407.00738 (2024) - [i15]Andrija Djurisic, Rosanne Liu, Mladen Nikolic:
Logit Scaling for Out-of-Distribution Detection. CoRR abs/2409.01175 (2024) - 2023
- [j14]Andrija Petrovic, Sandro Radovanovic
, Mladen Nikolic, Boris Delibasic
Structured prediction of sparse dependent variables for traffic state estimation in large-scale networks. Appl. Soft Comput. 133: 109893 (2023) - [j13]Andrija Petrovic
Controlling highway toll stations using deep learning, queuing theory, and differential evolution. Eng. Appl. Artif. Intell. 119: 105683 (2023) - [j12]Andrija Petrovic
Gaussian conditional random fields for classification. Expert Syst. Appl. 212: 118728 (2023) - [i14]Aleksa Bisercic, Mladen Nikolic, Mihaela van der Schaar, Boris Delibasic, Pietro Liò, Andrija Petrovic:
Interpretable Medical Diagnostics with Structured Data Extraction by Large Language Models. CoRR abs/2306.05052 (2023) - [i13]Max Zhu, Katarzyna Kobalczyk
Tabular Few-Shot Generalization Across Heterogeneous Feature Spaces. CoRR abs/2311.10051 (2023) - [i12]Max Zhu, Sinisa Stanivuk, Andrija Petrovic, Mladen Nikolic, Pietro Lio:
Incorporating LLM Priors into Tabular Learners. CoRR abs/2311.11628 (2023) - 2022
- [j11]Andrija Petrovic, Mladen Nikolic, Sandro Radovanovic
FAIR: Fair adversarial instance re-weighting. Neurocomputing 476: 14-37 (2022) - [j10]Marko Vasic
MoËT: Mixture of Expert Trees and its application to verifiable reinforcement learning. Neural Networks 151: 34-47 (2022) - [i11]Djordje Bozic, Predrag Tadic, Mladen Nikolic:
Intrinsically motivated option learning: a comparative study of recent methods. CoRR abs/2206.06007 (2022) - 2021
- [j9]Andrija Petrovic
Fair classification via Monte Carlo policy gradient method. Eng. Appl. Artif. Intell. 104: 104398 (2021) - [c5]Andreea Deac, Petar Velickovic, Ognjen Milinkovic, Pierre-Luc Bacon, Jian Tang, Mladen Nikolic:
Neural Algorithmic Reasoners are Implicit Planners. NeurIPS 2021: 15529-15542 - [i10]Andreea Deac, Petar Velickovic, Ognjen Milinkovic, Pierre-Luc Bacon, Jian Tang, Mladen Nikolic:
Neural Algorithmic Reasoners are Implicit Planners. CoRR abs/2110.05442 (2021) - 2020
- [j8]Milan Bankovic
Chapter One - Teaching graduate students how to review research articles and respond to reviewer comments. Adv. Comput. 116: 1-63 (2020) - [j7]Aleksandar Sekulic
Random Forest Spatial Interpolation. Remote. Sens. 12(10): 1687 (2020) - [i9]Stefan Spalevic, Petar Velickovic, Jovana J. Kovacevic, Mladen Nikolic:
Hierachial Protein Function Prediction with Tails-GNNs. CoRR abs/2007.12804 (2020) - [i8]Andreea Deac, Petar Velickovic, Ognjen Milinkovic, Pierre-Luc Bacon, Jian Tang, Mladen Nikolic:
XLVIN: eXecuted Latent Value Iteration Nets. CoRR abs/2010.13146 (2020) - [i7]Andrija Petrovic, Mladen Nikolic, Sandro Radovanovic, Boris Delibasic, Milos Jovanovic:
FAIR: Fair Adversarial Instance Re-weighting. CoRR abs/2011.07495 (2020)
2010 – 2019
- 2019
- [j6]Mladen Nikolic, Vesna Marinkovic
Portfolio theorem proving and prover runtime prediction for geometry. Ann. Math. Artif. Intell. 85(2-4): 119-146 (2019) - [i6]Andrija Petrovic, Mladen Nikolic, Milos Jovanovic, Boris Delibasic:
Gaussian Conditional Random Fields for Classification. CoRR abs/1902.00045 (2019) - [i5]Marko Vasic, Andrija Petrovic, Kaiyuan Wang, Mladen Nikolic, Rishabh Singh, Sarfraz Khurshid:
MoËT: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees. CoRR abs/1906.06717 (2019) - 2018
- [j5]Milutin Pejovic
Sparse regression interaction models for spatial prediction of soil properties in 3D. Comput. Geosci. 118: 1-13 (2018) - 2015
- [i4]Mirko Stojadinovic, Mladen Nikolic, Filip Maric:
Short Portfolio Training for CSP Solving. CoRR abs/1505.02070 (2015) - 2013
- [j4]Tomislav Hengl
Mapping efficiency and information content. Int. J. Appl. Earth Obs. Geoinformation 22: 127-138 (2013) - [j3]Mladen Nikolic, Filip Maric, Predrag Janicic
Simple algorithm portfolio for SAT. Artif. Intell. Rev. 40(4): 457-465 (2013) - [j2]Milena Vujosevic-Janicic
Software verification and graph similarity for automated evaluation of students' assignments. Inf. Softw. Technol. 55(6): 1004-1016 (2013) - 2012
- [j1]Mladen Nikolic:
Measuring similarity of graph nodes by neighbor matching. Intell. Data Anal. 16(6): 865-878 (2012) - [c4]Mladen Nikolic, Predrag Janicic
CDCL-Based Abstract State Transition System for Coherent Logic. AISC/MKM/Calculemus 2012: 264-279 - [i3]Milena Vujosevic-Janicic, Mladen Nikolic, Dusan Tosic, Viktor Kuncak:
Software Verification and Graph Similarity for Automated Evaluation of Students' Assignments. CoRR abs/1206.7064 (2012) - 2011
- [i2]Mladen Nikolic, Filip Maric, Predrag Janicic:
Simple Algorithm Portfolio for SAT. CoRR abs/1107.0268 (2011) - 2010
- [c3]Mladen Nikolic:
Statistical Methodology for Comparison of SAT Solvers. EMSQMS@IJCAR 2010: 33-38 - [c2]Mladen Nikolic:
Statistical Methodology for Comparison of SAT Solvers. SAT 2010: 209-222 - [i1]Mladen Nikolic:
Measuring Similarity of Graphs and their Nodes by Neighbor Matching. CoRR abs/1009.5290 (2010)
2000 – 2009
- 2009
- [c1]Mladen Nikolic, Filip Maric, Predrag Janicic
Instance-Based Selection of Policies for SAT Solvers. SAT 2009: 326-340
Coauthor Index
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 2024-10-07 21:16 CEST 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: