Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario A. Muñoz
Person information
- affiliation: The University of Melbourne, Parkville, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Hossein Alipour
, Mario Andrés Muñoz, Kate Smith-Miles:
On the impact of initialisation strategies on Maximum Flow algorithm performance. Comput. Oper. Res. 163: 106492 (2024)- [j18]João Luiz Junho Pereira, Kate Smith-Miles, Mario Andrés Muñoz, Ana Carolina Lorena:
Optimal selection of benchmarking datasets for unbiased machine learning algorithm evaluation. Data Min. Knowl. Discov. 38(2): 461-500 (2024) - [i4]Nicolau Andrés-Thió, Mario Andrés Muñoz, Kate Smith-Miles:
Characterising harmful data sources when constructing multi-fidelity surrogate models. CoRR abs/2403.08118 (2024) - 2023
- [j17]Kate Smith-Miles, Mario Andrés Muñoz:
Instance Space Analysis for Algorithm Testing: Methodology and Software Tools. ACM Comput. Surv. 55(12): 255:1-255:31 (2023) - [j16]Hossein Alipour, Mario Andrés Muñoz, Kate Smith-Miles:
Enhanced instance space analysis for the maximum flow problem. Eur. J. Oper. Res. 304(2): 411-428 (2023) - [j15]Hanan Alsouly, Michael Kirley, Mario Andrés Muñoz:
An Instance Space Analysis of Constrained Multiobjective Optimization Problems. IEEE Trans. Evol. Comput. 27(5): 1427-1439 (2023) - [j14]Neelofar, Kate Smith-Miles, Mario Andrés Muñoz, Aldeida Aleti:
Instance Space Analysis of Search-Based Software Testing. IEEE Trans. Software Eng. 49(4): 2642-2660 (2023) - [c13]Hanan Alsouly, Michael Kirley, Mario Andrés Muñoz:
Dynamic Landscape Analysis for Constrained Multiobjective Optimization Problems. AI (1) 2023: 429-441 - [c12]Ana Nikolikj, Saso Dzeroski, Mario Andrés Muñoz, Carola Doerr, Peter Korosec, Tome Eftimov:
Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances. GECCO 2023: 529-537 - [i3]Ana Nikolikj, Saso Dzeroski, Mario Andrés Muñoz, Carola Doerr, Peter Korosec, Tome Eftimov:
Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances. CoRR abs/2306.00479 (2023) - [i2]Neelofar, Kate Smith-Miles, Mario Andrés Muñoz, Aldeida Aleti:
Instance Space Analysis of Search-Based Software Testing. CoRR abs/2312.02392 (2023) - 2022
- [j13]Mario Andrés Muñoz, Michael Kirley, Kate Smith-Miles:
Analyzing randomness effects on the reliability of exploratory landscape analysis. Nat. Comput. 21(2): 131-154 (2022) - [j12]Estefania Yap, Mario Andrés Muñoz, Kate Smith-Miles:
Informing Multiobjective Optimization Benchmark Construction Through Instance Space Analysis. IEEE Trans. Evol. Comput. 26(6): 1246-1260 (2022) - [c11]Mario Andrés Muñoz, Hamed Soleimani, Sevvandi Kandanaarachchi:
Benchmarking algorithm portfolio construction methods. GECCO Companion 2022: 499-502 - [c10]Mario Andrés Muñoz:
Examining algorithm behavior using recurrence quantification and landscape analyses. GECCO Companion 2022: 1658-1665 - [i1]Hanan Alsouly, Michael Kirley, Mario Andrés Muñoz:
An Instance Space Analysis of Constrained Multi-Objective Optimization Problems. CoRR abs/2203.00868 (2022) - 2021
- [j11]Mario Andrés Muñoz, Michael Kirley:
Sampling Effects on Algorithm Selection for Continuous Black-Box Optimization. Algorithms 14(1): 19 (2021) - [j10]Estefania Yap, Mario Andrés Muñoz, Kate Smith-Miles:
On the diversity and robustness of parameterised multi-objective test suites. Appl. Soft Comput. 110: 107613 (2021) - [j9]Kate Smith-Miles, Jeffrey Christiansen, Mario Andrés Muñoz:
Revisiting where are the hard knapsack problems? via Instance Space Analysis. Comput. Oper. Res. 128: 105184 (2021) - [j8]Mario Andrés Muñoz, Tao Yan, Matheus R. Leal, Kate Smith-Miles, Ana Carolina Lorena, Gisele L. Pappa, Rômulo Madureira Rodrigues:
An Instance Space Analysis of Regression Problems. ACM Trans. Knowl. Discov. Data 15(2): 28:1-28:25 (2021) - 2020
- [j7]Sevvandi Kandanaarachchi, Mario A. Muñoz, Rob J. Hyndman, Kate Smith-Miles:
On normalization and algorithm selection for unsupervised outlier detection. Data Min. Knowl. Discov. 34(2): 309-354 (2020) - [j6]Mario A. Muñoz, Kate Smith-Miles:
Generating New Space-Filling Test Instances for Continuous Black-Box Optimization. Evol. Comput. 28(3): 379-404 (2020) - [c9]Estefania Yap, Mario A. Muñoz, Kate Smith-Miles, Arnaud Liefooghe:
Instance Space Analysis of Combinatorial Multi-objective Optimization Problems. CEC 2020: 1-8
2010 – 2019
- 2019
- [c8]Sevvandi Kandanaarachchi, Mario A. Muñoz, Kate Smith-Miles:
Instance Space Analysis for Unsupervised Outlier Detection. EDML@SDM 2019: 32-41 - 2018
- [j5]Mario A. Muñoz, Laura Villanova, Davaatseren Baatar, Kate Smith-Miles:
Instance spaces for machine learning classification. Mach. Learn. 107(1): 109-147 (2018) - 2017
- [j4]Mario A. Muñoz, Kate Amanda Smith-Miles:
Performance Analysis of Continuous Black-Box Optimization Algorithms via Footprints in Instance Space. Evol. Comput. 25(4) (2017) - [c7]Mario A. Muñoz, Kate Smith-Miles:
Non-parametric model of the space of continuous black-box optimization problems. GECCO (Companion) 2017: 175-176 - [c6]Mario A. Muñoz, Kate Smith-Miles:
Generating custom classification datasets by targeting the instance space. GECCO (Companion) 2017: 1582-1588 - 2016
- [c5]Mario A. Muñoz, Michael Kirley:
ICARUS: Identification of complementary algorithms by uncovered sets. CEC 2016: 2427-2432 - 2015
- [j3]Mario A. Muñoz, Yuan Sun, Michael Kirley, Saman K. Halgamuge:
Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges. Inf. Sci. 317: 224-245 (2015) - [j2]Mario A. Muñoz, Michael Kirley, Saman K. Halgamuge:
Exploratory Landscape Analysis of Continuous Space Optimization Problems Using Information Content. IEEE Trans. Evol. Comput. 19(1): 74-87 (2015) - [c4]Mario A. Muñoz, Kate Smith-Miles:
Effects of function translation and dimensionality reduction on landscape analysis. CEC 2015: 1336-1342 - 2013
- [b1]Mario Andrés Muñoz Acosta:
Decision support systems for the automatic selection of algorithms for continuous optimization problems. University of Melbourne, Australia, 2013 - 2012
- [c3]Mario A. Muñoz, Michael Kirley, Saman K. Halgamuge:
Landscape characterization of numerical optimization problems using biased scattered data. IEEE Congress on Evolutionary Computation 2012: 1-8 - [c2]Mario A. Muñoz, Michael Kirley, Saman K. Halgamuge:
A Meta-learning Prediction Model of Algorithm Performance for Continuous Optimization Problems. PPSN (1) 2012: 226-235 - 2010
- [c1]Mario A. Muñoz, Saman K. Halgamuge, Wilfredo Alfonso, Eduardo Caicedo:
Simplifying the Bacteria Foraging Optimization Algorithm. IEEE Congress on Evolutionary Computation 2010: 1-7
2000 – 2009
- 2009
- [j1]Mario A. Muñoz, Jesús A. López, Eduardo Caicedo:
An artificial beehive algorithm for continuous optimization. Int. J. Intell. Syst. 24(11): 1080-1093 (2009) - 2007
- [p1]Mario A. Muñoz, Jesús A. López, Eduardo Caicedo:
Bacteria Swarm Foraging Optimization for Dynamical Resource Allocation in a Multizone Temperature Experimentation Platform. Analysis and Design of Intelligent Systems using Soft Computing Techniques 2007: 427-435
Coauthor Index
aka: Kate Amanda Smith-Miles
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-11 20:14 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:
