default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatej Crepinsek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Miha Ravber, Marjan Mernik, Shih-Hsi Liu, Marko Smid, Matej Crepinsek:
Confidence Bands Based on Rating Demonstrated on the CEC 2021 Competition Results. CEC 2024: 1-8- 2022
- [j23]Miha Ravber
, Shih-Hsi Liu, Marjan Mernik, Matej Crepinsek:
Maximum number of generations as a stopping criterion considered harmful. Appl. Soft Comput. 128: 109478 (2022) - [j22]Zeljko Kovacevic, Miha Ravber, Shih-Hsi Liu, Matej Crepinsek:
Automatic compiler/interpreter generation from programs for Domain-Specific Languages: Code bloat problem and performance improvement. J. Comput. Lang. 70: 101105 (2022) - [c11]Elvis Popovic, Nikola Ivkovic, Matej Crepinsek:
ACOCaRS: Ant Colony Optimization Algorithm for Traveling Car Renter Problem. BIOMA 2022: 31-45 - [e1]Marjan Mernik, Tome Eftimov, Matej Crepinsek:
Bioinspired Optimization Methods and Their Applications - 10th International Conference, BIOMA 2022, Maribor, Slovenia, November 17-18, 2022, Proceedings. Lecture Notes in Computer Science 13627, Springer 2022, ISBN 978-3-031-21093-8 [contents] - 2021
- [j21]Miha Ravber, Zeljko Kovacevic, Matej Crepinsek, Marjan Mernik:
Inferring Absolutely Non-Circular Attribute Grammars with a Memetic Algorithm. Appl. Soft Comput. 100: 106956 (2021) - [j20]Jernej Jerebic, Marjan Mernik, Shih-Hsi Liu, Miha Ravber, Mihael Baketaric, Luka Mernik, Matej Crepinsek:
A novel direct measure of exploration and exploitation based on attraction basins. Expert Syst. Appl. 167: 114353 (2021)
2010 – 2019
- 2019
- [c10]Ziga Leber, Matej Crepinsek, Tomaz Kosar:
Simultaneous multiple representation editing environment for primary school education. VL/HCC 2019: 175-179 - 2018
- [j19]Marko Jesenik, Marjan Mernik, Matej Crepinsek, Miha Ravber, Mladen Trlep:
Searching for soil models' parameters using metaheuristics. Appl. Soft Comput. 69: 131-148 (2018) - [c9]Miha Ravber, Matej Crepinsek, Marjan Mernik, Tomaz Kosar:
Tuning Multi-Objective Optimization Algorithms for the Integration and Testing Order Problem. BIOMA 2018: 234-245 - 2017
- [j18]Niki Vecek, Matej Crepinsek, Marjan Mernik:
On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms. Appl. Soft Comput. 54: 23-45 (2017) - [j17]Miha Ravber, Marjan Mernik, Matej Crepinsek:
The impact of Quality Indicators on the rating of Multi-objective Evolutionary Algorithms. Appl. Soft Comput. 55: 265-275 (2017) - [j16]Niki Vecek, Shih-Hsi Liu, Matej Crepinsek, Marjan Mernik:
On the Importance of the Artificial Bee Colony Control Parameter 'Limit'. Inf. Technol. Control. 46(4): 566-604 (2017) - [c8]Miha Ravber, Marjan Mernik, Matej Crepinsek:
Ranking Multi-Objective Evolutionary Algorithms using a chess rating system with Quality Indicator ensemble. CEC 2017: 1503-1510 - 2016
- [j15]Niki Vecek, Marjan Mernik, Bogdan Filipic, Matej Crepinsek:
Parameter tuning with Chess Rating System (CRS-Tuning) for meta-heuristic algorithms. Inf. Sci. 372: 446-469 (2016) - [j14]Matej Crepinsek, Shih-Hsi Liu, Luka Mernik, Marjan Mernik:
Is a comparison of results meaningful from the inexact replications of computational experiments? Soft Comput. 20(1): 223-235 (2016) - 2015
- [j13]Iztok Fister, Iztok Peterin, Marjan Mernik, Matej Crepinsek:
Hybrid evolutionary algorithm for the b-chromatic number. J. Heuristics 21(4): 501-521 (2015) - [j12]Marjan Mernik, Shih-Hsi Liu, Dervis Karaboga, Matej Crepinsek:
On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation. Inf. Sci. 291: 115-127 (2015) - [c7]Vojislav Dukic, Ivan Lukovic, Matej Crepinsek, Tomaz Kosar, Marjan Mernik:
Information System Software Development with Support for Application Traceability. PROFES 2015: 513-527 - 2014
- [j11]Matej Crepinsek, Shih-Hsi Liu, Marjan Mernik:
Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them. Appl. Soft Comput. 19: 161-170 (2014) - [j10]Niki Vecek, Marjan Mernik, Matej Crepinsek:
A chess rating system for evolutionary algorithms: A new method for the comparison and ranking of evolutionary algorithms. Inf. Sci. 277: 656-679 (2014) - [c6]Niki Vecek, Marjan Mernik, Matej Crepinsek, Dejan Hrncic:
A Comparison between Different Chess Rating Systems for Ranking Evolutionary Algorithms. FedCSIS 2014: 511-518 - 2013
- [j9]Shih-Hsi Liu, Marjan Mernik, Dejan Hrncic, Matej Crepinsek:
A parameter control method of evolutionary algorithms using exploration and exploitation measures with a practical application for fitting Sovova's mass transfer model. Appl. Soft Comput. 13(9): 3792-3805 (2013) - [j8]Matej Crepinsek, Shih-Hsi Liu, Marjan Mernik:
Exploration and exploitation in evolutionary algorithms: A survey. ACM Comput. Surv. 45(3): 35:1-35:33 (2013) - 2012
- [j7]Matej Crepinsek, Shih-Hsi Liu, Luka Mernik:
A note on teaching-learning-based optimization algorithm. Inf. Sci. 212: 79-93 (2012) - 2011
- [j6]Ines Ceh, Matej Crepinsek, Tomaz Kosar, Marjan Mernik:
Ontology driven development of domain-specific languages. Comput. Sci. Inf. Syst. 8(2): 317-342 (2011) - 2010
- [j5]Tomaz Kosar, Nuno Oliveira, Marjan Mernik, Maria João Varanda Pereira, Matej Crepinsek, Daniela Carneiro da Cruz, Pedro Rangel Henriques:
Comparing general-purpose and domain-specific languages: An empirical study. Comput. Sci. Inf. Syst. 7(2): 247-264 (2010) - [j4]Matej Crepinsek, Tomaz Kosar, Marjan Mernik, Julien Cervelle, Rémi Forax, Gilles Roussel:
On automata and language based grammar metrics. Comput. Sci. Inf. Syst. 7(2): 309-329 (2010)
2000 – 2009
- 2009
- [c5]Julien Cervelle, Matej Crepinsek, Rémi Forax, Tomaz Kosar, Marjan Mernik, Gilles Roussel:
On defining quality based grammar metrics. IMCSIT 2009: 651-658 - [c4]Tomaz Kosar, Marjan Mernik, Matej Crepinsek, Pedro Rangel Henriques, Daniela Carneiro da Cruz, Maria João Varanda Pereira, Nuno Oliveira:
Influence of domain-specific notation to program understanding. IMCSIT 2009: 675-682 - [c3]Nuno Oliveira, Pedro Rangel Henriques, Daniela Carneiro da Cruz, Maria João Varanda Pereira, Marjan Mernik, Tomaz Kosar, Matej Crepinsek:
Applying program comprehension techniques to karel robot programs. IMCSIT 2009: 699-706 - 2005
- [j3]Matej Crepinsek, Marjan Mernik, Viljem Zumer:
Extracting grammar from programs: brute force approach. ACM SIGPLAN Notices 40(4): 29-38 (2005) - [j2]Matej Crepinsek, Marjan Mernik, Faizan Javed, Barrett R. Bryant, Alan P. Sprague:
Extracting grammar from programs: evolutionary approach. ACM SIGPLAN Notices 40(4): 39-46 (2005) - [c2]Matej Crepinsek, Marjan Mernik, Barrett R. Bryant, Faizan Javed, Alan P. Sprague:
Inferring Context-Free Grammars for Domain-Specific Languages. LDTA@ETAPS 2005: 99-116 - 2004
- [j1]Marjan Mernik, Matej Crepinsek, Tomaz Kosar, Damijan Rebernak, Viljem Zumer:
Grammar-Based Systems: Definition and Examples. Informatica (Slovenia) 28(3): 245-255 (2004) - [c1]Faizan Javed, Barrett R. Bryant, Matej Crepinsek, Marjan Mernik, Alan P. Sprague:
Context-free grammar induction using genetic programming. ACM Southeast Regional Conference 2004: 404-405
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-08-21 20:29 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:
