default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMadalina Raschip
Person information
- affiliation: Alexandru Ioan Cuza University of Iasi, Faculty of Computer Science, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Cecilia Mariciuc, Madalina Raschip:
Hybrid PSO-Based Rule Classifier for Disease Detection. ICAART (3) 2024: 906-914- 2022
- [c23]Ioana Sitaru, Madalina Raschip
:
Algorithm Selection for Combinatorial Packing Problems. CEC 2022: 1-8 - [c22]Nicu Buliga, Madalina Raschip:
Zorros at CheckThat!-2022: Ensemble Model for Identifying Relevant Claims in Tweets. CLEF (Working Notes) 2022: 456-467 - 2021
- [j2]Victor Luncasu, Madalina Raschip:
A Graph-Based Approach for the DNA Word Design Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2747-2752 (2021) - [c21]Vlad-Ioan Lupoaie, Ivona-Alexandra Chili, Madalina Raschip, Mihaela Elena Breaban:
An Evolutionary Approach for Solving Multi-Objective WCSPs Using Mini-Bucket Elimination Heuristics. CEC 2021: 408-415 - [c20]Cecilia Mariciuc, Madalina Raschip:
The Application of Sequential Pattern Mining Techniques on MIMIC-IV. IDDM 2021: 136-149
2010 – 2019
- 2019
- [c19]Vlad-Ioan Lupoaie, Ivona-Alexandra Chili, Mihaela Elena Breaban, Madalina Raschip:
SOM-Guided Evolutionary Search for Solving MinMax Multiple-TSP. CEC 2019: 73-80 - [c18]Cristian Frasinaru, Madalina Raschip:
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. CPAIOR 2019: 292-303 - [c17]Cristian Frasinaru, Madalina Raschip:
Greedy Best-First Search for the Optimal-Size Sorting Network Problem. KES 2019: 447-454 - [i3]Vlad-Ioan Lupoaie, Ivona-Alexandra Chili, Mihaela Elena Breaban, Madalina Raschip:
SOM-Guided Evolutionary Search for Solving MinMax Multiple-TSP. CoRR abs/1907.11910 (2019) - 2018
- [j1]Ionut Pistol, Diana Trandabat, Madalina Raschip:
Medi-Test: Generating Tests from Medical Reference Texts. Data 3(4): 70 (2018) - [c16]Madalina Raschip, Cornelius Croitoru, Cristian Frasinaru:
New Evolutionary Approaches for SAT Solving. ICTAI 2018: 522-526 - 2017
- [c15]Raluca Necula, Mihaela Breaban, Madalina Raschip:
Tackling Dynamic Vehicle Routing Problem with Time Windows by means of ant colony system. CEC 2017: 2480-2487 - [i2]Raluca Necula, Mihaela Breaban, Madalina Raschip:
Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System. CoRR abs/1704.01859 (2017) - [i1]Cristian Frasinaru, Madalina Raschip:
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. CoRR abs/1707.08725 (2017) - 2015
- [c14]Madalina Raschip, Cornelius Croitoru, Kilian Stoffel:
Using association rules to guide evolutionary search in solving constraint satisfaction. CEC 2015: 744-750 - [c13]Raluca Necula, Madalina Raschip, Mihaela Breaban:
Balancing the Subtours for Multiple TSP Approached with ACS: Clustering-Based Approaches Vs. MinMax Formulation. EVOLVE 2015: 210-223 - [c12]Madalina Raschip, Cornelius Croitoru, Kilian Stoffel:
Guiding Evolutionary Search with Association Rules for Solving Weighted CSPs. GECCO 2015: 481-488 - [c11]Raluca Necula, Mihaela Breaban, Madalina Raschip:
Performance Evaluation of Ant Colony Systems for the Single-Depot Multiple Traveling Salesman Problem. HAIS 2015: 257-268 - [c10]Raluca Necula, Mihaela Breaban, Madalina Raschip:
Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems. ICTAI 2015: 873-880 - 2012
- [c9]Mihnea Donciu, Madalina Ionita, Mihai Dascalu, Stefan Trausan-Matu:
Ant Colony Optimisation for Automatically Populating Ontologies with Individuals. SYNASC 2012: 227-232 - 2011
- [c8]Madalina Raschip, Cornelius Croitoru:
A Genetic Algorithm Hybridized with the Discrete Lagrangian Method for Trap Escaping. LION 2011: 351-363 - [c7]Mihnea Donciu, Madalina Ionita, Mihai Dascalu, Stefan Trausan-Matu:
The Runner - Recommender System of Workout and Nutrition for Runners. SYNASC 2011: 230-238 - 2010
- [c6]Madalina Raschip, Cornelius Croitoru:
A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem. EvoCOP 2010: 252-263 - [c5]Madalina Raschip, Henri Luchian:
Using messy genetic algorithms for solving the winner determination problem. GECCO (Companion) 2010: 1825-1832
2000 – 2009
- 2007
- [c4]Mihaela Breaban, Madalina Ionita, Cornelius Croitoru:
A new PSO approach to constraint satisfaction. IEEE Congress on Evolutionary Computation 2007: 1948-1954 - 2006
- [c3]Madalina Ionita, Cornelius Croitoru, Mihaela Breaban:
Incorporating Inference into Evolutionary Algorithms for Max-CSP. Hybrid Metaheuristics 2006: 139-149 - [c2]Madalina Ionita, Mihaela Breaban, Cornelius Croitoru:
A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs. SYNASC 2006: 323-329 - 2005
- [c1]Madalina Ionita, Henri Luchian:
Two problem independent methods for generating initial solutions. Congress on Evolutionary Computation 2005: 1442-1447
Coauthor Index
aka: Mihaela Elena Breaban
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 23:18 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:
