default search action
Daniela Danciulescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]M. Kalpana Chowdary
, E. Anu Priya, Daniela Danciulescu, J. Anitha, D. Jude Hemanth:
Hybrid deep learning models based emotion recognition with speech signals. Intell. Decis. Technol. 17(4): 1435-1453 (2023) - [c8]Mihaela Colhon, Gabriel Stoian, Constantin-Cristian Dinu, Cristina Popirlan, Cristina-Mihaela Tudorache, Irina-Valentina Tudor, Daniela Danciulescu:
Sliding Window Method for Imputing Missing Data. RoEduNet 2023: 1-6 - [c7]Claudiu Ionut Popirlan, Cristina-Mihaela Tudorache, Irina-Valentina Tudor, Constantin-Cristian Dinu, Mihaela Colhon, Gabriel Stoian, Daniela Danciulescu, Cristina Popirlan:
Investigating User Characteristics and Behaviors on Social Media as Prequel for Fake News Detection. RoEduNet 2023: 1-5 - 2020
- [j7]Ovidiu Cosma
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Comput. Oper. Res. 118: 104906 (2020) - [j6]Ovidiu Cosma, Petrica C. Pop
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem. Informatica 31(4): 681-706 (2020)
2010 – 2019
- 2019
- [j5]Ovidiu Cosma, Daniela Danciulescu, Petrica C. Pop
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers. IEEE Access 7: 113684-113698 (2019) - [j4]Alexandru Tugui
The Biological as a Double Limit for Artificial Intelligence: Review and Futuristic Debate. Int. J. Comput. Commun. Control 14(2): 253-271 (2019) - [c6]Monica Vladoiu, Zoran Constantinescu, Daniela Danciulescu:
Career Tracks and Job Requirements in Information Systems vs. ACM/AIS IS 2010 Curriculum Guidelines: An Empirical Study. ISD 2019 - 2018
- [j3]Amelia Badica, Costin Badica
Multi-agent modelling and simulation of graph-based predator-prey dynamic systems: A BDI approach. Expert Syst. J. Knowl. Eng. 35(5) (2018) - [j2]Andrei Horvat Marc
A decomposition-based method for solving the clustered vehicle routing problem. Log. J. IGPL 26(1): 83-95 (2018) - [c5]Amelia Badica, Costin Badica
Greedy Heuristics for Automatic Synthesis of Efficient Block-Structured Scheduling Processes from Declarative Specifications. AIAI 2018: 183-195 - 2017
- [c4]Amelia Badica, Costin Badica
Optimization of Freight Transportation Brokerage Using Agents and Constraints. EANN 2017: 451-464 - 2016
- [c3]Cosmin Sabo
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. ISDA 2016: 1-10 - 2015
- [j1]Daniela Danciulescu:
Formal Languages Generation in Systems of Knowledge Representation Based on Stratified Graphs. Informatica 26(3): 407-417 (2015) - [c2]Viorel Negru
Natural Language Agreement in the Generation Mechanism based on Stratified Graphs. BCI 2015: 36:1-36:8 - [c1]Andrei Horvat Marc
A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem. HAIS 2015: 679-689
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-05 21:13 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: