default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGloria Cerasela Crisan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Andreea Vescan
, Camelia Serban, Gloria Cerasela Crisan:
Computational intelligence in software defects rules discovery. Soft Comput. 26(14): 6925-6939 (2022)- [c18]Sorin Ionut Conea, Gloria Cerasela Crisan:
Green air quality monitoring system based on Arduino. ECAI 2022: 1-4 - [c17]Cristina Ticala, Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Oliviu Matei, Mara Hajdu-Macelaru, Petrica C. Pop:
Aspects on Image Edge Detection Based on Sensitive Swarm Intelligence. HAIS 2022: 455-465 - 2021
- [j12]Gloria Cerasela Crisan, Elena Nechita, Dana Simian:
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods. IEEE Access 9: 5312-5331 (2021) - [j11]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop:
Secure traveling salesman problem with intelligent transport systems features. Log. J. IGPL 29(6): 925-935 (2021) - [c16]Andreea Vescan, Camelia Serban, Gloria Cerasela Crisan:
Software Defects Rules Discovery. ICST Workshops 2021: 101-109 - 2020
- [j10]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei:
Economical connections between several European countries based on TSP data. Log. J. IGPL 28(1): 33-44 (2020) - [c15]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop:
Studying Heuristics Adaptation to a Specific Degree of Fuzziness. FUZZ-IEEE 2020: 1-7 - [c14]Barbara Gallina, Görkem Paçaci, David Johnson, Steve McKeever, Andreas Hamfelt, Stefania Costantini, Pierangelo Dell'Acqua, Gloria Cerasela Crisan:
Towards Explainable, Compliant and Adaptive Human-Automation Interaction. XAILA@JURIX 2020
2010 – 2019
- 2019
- [j9]Andreas Holzinger, Markus Plass, Michael D. Kickmeier-Rust, Katharina Holzinger, Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Vasile Palade:
Interactive machine learning: experimental evidence for the human in the algorithmic loop - A case study on Ant Colony Optimization. Appl. Intell. 49(7): 2401-2414 (2019) - [j8]Gloria Cerasela Crisan, László Barna Iantovics, László Kovács:
On the neutrality of two symmetric TSP solvers toward instance specification. Sci. China Inf. Sci. 62(11): 219103:1-219103:3 (2019) - [j7]László Barna Iantovics, Roumen Kountchev, Gloria Cerasela Crisan:
ExtrIntDetect - A New Universal Method for the Identification of Intelligent Cooperative Multiagent Systems with Extreme Intelligence. Symmetry 11(9): 1123 (2019) - [c13]Ufuoma Chima Apoki, Gloria Cerasela Crisan:
Employing Software Agents and Constructivism to make Massive Open Online Courses more student-oriented. ECAI 2019: 1-8 - [c12]Gloria Cerasela Crisan, Elena Nechita:
On a cooperative truck-and-drone delivery system. KES 2019: 38-47 - [c11]Gloria Cerasela Crisan, László Barna Iantovics, Elena Nechita:
Computational Intelligence for Solving Difficult Transportation Problems. KES 2019: 172-181 - 2018
- [j6]Camelia-Mihaela Pintea, Andreea Camelia Tripon, Anca Avram, Gloria Cerasela Crisan:
Multi-agents features on Android platforms. Complex Adapt. Syst. Model. 6: 10 (2018) - [c10]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Petrica C. Pop:
Towards Secure Transportation Based on Intelligent Transport Systems. Novel Approach and Concepts. SOCO-CISIS-ICEUTE 2018: 469-477 - [i4]Camelia-Mihaela Pintea, Andreea Camelia Tripon, Anca Avram, Gloria Cerasela Crisan:
Multi-agents features on Android platforms. CoRR abs/1807.05826 (2018) - 2017
- [j5]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Vasile Palade:
Emergency management using geographic information systems: application to the first Romanian traveling salesman problem instance. Knowl. Inf. Syst. 50(1): 265-285 (2017) - [i3]Andreas Holzinger, Markus Plass, Katharina Holzinger, Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Vasile Palade:
A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop. CoRR abs/1708.01104 (2017) - 2016
- [c9]Andreas Holzinger, Markus Plass, Katharina Holzinger, Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Vasile Palade:
Towards interactive Machine Learning (iML): Applying Ant Colony Algorithms to Solve the Traveling Salesman Problem with the Human-in-the-Loop Approach. CD-ARES 2016: 81-95 - [c8]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei:
An Analysis of the Hardness of Novel TSP Iberian Instances. HAIS 2016: 353-364 - [p1]Elena Nechita, Gloria Cerasela Crisan, Sergiu-Madalin Obreja, Constantin-Sebastian Damian:
Intelligent Carpooling System - A Case Study for Bacău Metropolitan Area. New Approaches in Intelligent Control 2016: 43-72 - 2015
- [j4]Nadia Lahrichi, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei, Gloria Cerasela Crisan, Thibaut Vidal:
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP. Eur. J. Oper. Res. 246(2): 400-412 (2015) - [c7]Camelia-Mihaela Pintea, Simone A. Ludwig, Gloria Cerasela Crisan:
Adaptability of a discrete PSO algorithm applied to the Traveling Salesman Problem with fuzzy data. FUZZ-IEEE 2015: 1-6 - 2014
- [c6]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop:
On the resilience of an ant-based system in fuzzy environments. An empirical study. FUZZ-IEEE 2014: 2588-2593 - 2013
- [j3]Gabriela Czibula, Gloria Cerasela Crisan, Camelia-Mihaela Pintea, István Gergely Czibula:
Soft Computing Approaches on the Bandwidth Problem. Informatica 24(2): 169-180 (2013) - 2012
- [j2]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Camelia Chira:
Hybrid ant models with a transition policy for solving a complex problem. Log. J. IGPL 20(3): 560-569 (2012) - [j1]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Mihai Manea:
Parallel ACO with a Ring Neighborhood for Dynamic TSP. J. Inf. Technol. Res. 5(4): 1-13 (2012) - [i2]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Mihai Manea:
Parallel ACO with a Ring Neighborhood for Dynamic TSP. CoRR abs/1208.4945 (2012) - [i1]Gabriela Czibula, Gloria Cerasela Crisan, Camelia-Mihaela Pintea, István Gergely Czibula:
Soft Computing approaches on the Bandwidth Problem. CoRR abs/1208.5554 (2012) - 2010
- [c5]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Camelia Chira:
A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem. HAIS (1) 2010: 405-412
2000 – 2009
- 2009
- [c4]Camelia Chira, Camelia-Mihaela Pintea, Gloria Cerasela Crisan, D. Dumitrescu:
Solving the linear ordering problem using ant models. GECCO 2009: 1803-1804 - [c3]Teodor Gabriel Crainic, Gloria Cerasela Crisan, Michel Gendreau, Nadia Lahrichi, Walter Rei:
A concurrent evolutionary approach for rich combinatorial optimization. GECCO (Companion) 2009: 2017-2022 - [c2]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Camelia Chira, Dumitru Dumitrescu:
A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables. HAIS 2009: 376-383 - [c1]Teodor Gabriel Crainic, Gloria Cerasela Crisan, Michel Gendreau, Nadia Lahrichi, Walter Rei:
Multi-thread integrative cooperative optimization for rich combinatorial problems. IPDPS 2009: 1-8
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-04-24 22:56 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:
