default search action
Daniel Aloise
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Marlon Jeske, Brunilde Sansò, Daniel Aloise, Mariá C. V. Nascimento:
Received Signal Strength Indicator Prediction for Mesh Networks in a Real Urban Environment Using Machine Learning. IEEE Access 12: 165861-165877 (2024) - [j38]Caroline T. M. Rocha, Bruno Jefferson de S. Pessoa, Daniel Aloise, Lucídio A. F. Cabral:
An efficient implementation of a VNS heuristic for the weighted fair sequences problem. Int. Trans. Oper. Res. 31(3): 1720-1735 (2024) - [i9]Antonio M. Sudoso, Daniel Aloise:
A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering. CoRR abs/2410.06187 (2024) - 2023
- [j37]Quentin Fournier, Gaétan Marceau Caron, Daniel Aloise:
A Practical Survey on Faster and Lighter Transformers. ACM Comput. Surv. 55(14s): 304:1-304:40 (2023) - [c14]Vithor Gomes Ferreira Bertalan, Daniel Aloise:
Using Transformer Models and Textual Analysis for Log Parsing. ISSRE 2023: 367-378 - [c13]Rodrigo Randel, Daniel Aloise, Alain Hertz:
A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation. SDM 2023: 127-135 - [i8]Quentin Fournier, Daniel Aloise, Leandro Rincon Costa:
Language Models for Novelty Detection in System Call Traces. CoRR abs/2309.02206 (2023) - 2022
- [j36]Diego Rocha Lima, Daniel Aloise, Dario J. Aloise, Claudio Contardo:
Visual attractiveness in vehicle routing via bi-objective optimization. Comput. Oper. Res. 137: 105507 (2022) - [j35]Irving Muller Rodrigues, Aleksandr Khvorov, Daniel Aloise, Roman Vasiliev, Dmitrij V. Koznov, Eraldo Rezende Fernandes, George A. Chernishev, Dmitry V. Luciv, Nikita Povarov:
TraceSim: An Alignment Method for Computing Stack Trace Similarity. Empir. Softw. Eng. 27(2): 53 (2022) - [j34]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds. J. Heuristics 28(4): 539-582 (2022) - [j33]Iman Kohyarnejadfard, Daniel Aloise, Seyed Vahid Azhari, Michel R. Dagenais:
Anomaly detection in microservice environments using distributed tracing data analysis and NLP. J. Cloud Comput. 11: 25 (2022) - [j32]Isabelle Bouchard, Marie-Ève Rancourt, Daniel Aloise, Freddie Kalaitzis:
On Transfer Learning for Building Damage Assessment from Satellite Imagery in Emergency Contexts. Remote. Sens. 14(11): 2532 (2022) - [c12]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
OptiMaP: swarm-powered Optimized 3D Mapping Pipeline for emergency response operations. DCOSS 2022: 269-276 - [c11]Irving Muller Rodrigues, Daniel Aloise, Eraldo Rezende Fernandes:
FaST: A linear time stack trace alignment heuristic for crash report deduplication. MSR 2022: 549-560 - 2021
- [j31]Rodrigo Randel, Daniel Aloise, Simon J. Blanchard, Alain Hertz:
A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. Data Min. Knowl. Discov. 35(6): 2341-2368 (2021) - [j30]Iman Kohyarnejadfard, Daniel Aloise, Michel R. Dagenais, Mahsa Shakeri:
A Framework for Detecting System Performance Anomalies Using Tracing Data Analysis. Entropy 23(8): 1011 (2021) - [j29]Allyson Silva, Daniel Aloise, Leandro C. Coelho, Caroline T. M. Rocha:
Heuristics for the dynamic facility location problem with modular capacities. Eur. J. Oper. Res. 290(2): 435-452 (2021) - [j28]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
The Covering-Assignment Problem for Swarm-Powered Ad Hoc Clouds: A Distributed 3-D Mapping Usecase. IEEE Internet Things J. 8(9): 7316-7332 (2021) - [j27]Daniel Aloise, Gilles Caporossi, Sébastien Le Digabel:
Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD). J. Glob. Optim. 81(1): 1-2 (2021) - [c10]Quentin Fournier, Daniel Aloise, Seyed Vahid Azhari, François Tetreault:
On Improving Deep Learning Trace Analysis with System Call Arguments. MSR 2021: 120-130 - [i7]Quentin Fournier, Daniel Aloise:
Empirical comparison between autoencoders and traditional dimensionality reduction methods. CoRR abs/2103.04874 (2021) - [i6]Quentin Fournier, Naser Ezzati-Jivan, Daniel Aloise, Michel R. Dagenais:
Automatic Cause Detection of Performance Problems in Web Applications. CoRR abs/2103.04954 (2021) - [i5]Quentin Fournier, Daniel Aloise, Seyed Vahid Azhari, François Tetreault:
On Improving Deep Learning Trace Analysis with System Call Arguments. CoRR abs/2103.06915 (2021) - [i4]Quentin Fournier, Gaétan Marceau Caron, Daniel Aloise:
A Practical Survey on Faster and Lighter Transformers. CoRR abs/2103.14636 (2021) - [i3]Rodrigo Randel, Daniel Aloise, Alain Hertz:
Exploring dual information in distance metric learning for clustering. CoRR abs/2105.12703 (2021) - [i2]Laurent Boucaud, Daniel Aloise, Nicolas Saunier:
Soft Attention: Does it Actually Help to Learn Social Interactions in Pedestrian Trajectory Prediction? CoRR abs/2106.15321 (2021) - 2020
- [j26]Daniel Nobre Pinheiro, Daniel Aloise, Simon J. Blanchard:
Convex fuzzy k-medoids clustering. Fuzzy Sets Syst. 389: 66-92 (2020) - [j25]Robin Gassais, Naser Ezzati-Jivan, Jose M. Fernandez, Daniel Aloise, Michel R. Dagenais:
Multi-level host-based intrusion detection system for Internet of things. J. Cloud Comput. 9: 62 (2020) - [c9]Mohammed Najib Haouas, Daniel Aloise, Gilles Pesant:
An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem. CPAIOR 2020: 256-272 - [c8]Daniel Nobre Pinheiro, Samuel Xavier de Souza, Daniel Aloise:
Scaling Optimizations for Large-Scale Distributed Data with Lightweight Coresets. IPDPS Workshops 2020: 426-429 - [c7]Irving Muller Rodrigues, Daniel Aloise, Eraldo Rezende Fernandes, Michel R. Dagenais:
A Soft Alignment Model for Bug Deduplication. MSR 2020: 43-53 - [c6]Théo Moins, Daniel Aloise, Simon J. Blanchard:
RecSeats: A Hybrid Convolutional Neural Network Choice Model for Seat Recommendations at Reserved Seating Venues. RecSys 2020: 309-317
2010 – 2019
- 2019
- [j24]Dusan Dzamic, Daniel Aloise, Nenad Mladenovic:
Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann. Oper. Res. 272(1-2): 273-287 (2019) - [c5]Quentin Fournier, Daniel Aloise:
Empirical Comparison between Autoencoders and Traditional Dimensionality Reduction Methods. AIKE 2019: 211-214 - [c4]Quentin Fournier, Naser Ezzati-Jivan, Daniel Aloise, Michel R. Dagenais:
Automatic Cause Detection of Performance Problems in Web Applications. ISSRE Workshops 2019: 398-405 - 2018
- [j23]Bruno Jefferson de S. Pessoa, Daniel Aloise, Lucídio dos Anjos F. Cabral:
The Weighted Fair Sequences Problem. Comput. Oper. Res. 91: 121-131 (2018) - [j22]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Igor A. M. Barbosa, Nenad Mladenovic, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Daniel Aloise:
Efficient heuristics for the minimum labeling global cut problem. Electron. Notes Discret. Math. 66: 23-30 (2018) - [j21]Fernanda B. A. R. Mariz, Mariana Rodrigues de Almeida, Daniel Aloise:
A review of Dynamic Data Envelopment Analysis: state of the art and applications. Int. Trans. Oper. Res. 25(2): 469-505 (2018) - [j20]Daniel Aloise, Claudio Contardo:
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. J. Glob. Optim. 71(3): 613-630 (2018) - [j19]Kayo Gonçalves-e-Silva, Daniel Aloise, Samuel Xavier de Souza:
Parallel synchronous and asynchronous coupled simulated annealing. J. Supercomput. 74(6): 2841-2869 (2018) - [c3]Rodrigo Randel, Daniel Aloise, Nenad Mladenovic, Pierre Hansen:
On the k-Medoids Model for Semi-supervised Clustering. ICVNS 2018: 13-27 - [c2]Pierre Hulot, Daniel Aloise, Sanjay Dominik Jena:
Towards Station-Level Demand Prediction for Effective Rebalancing in Bike-Sharing Systems. KDD 2018: 378-386 - [i1]Demetrios Coutinho, Samuel Xavier de Souza, Daniel Aloise:
A Scalable Shared-Memory Parallel Simplex for Large-Scale Linear Programming. CoRR abs/1804.04737 (2018) - 2017
- [j18]Daniel Aloise, Nielsen Castelo Damasceno, Nenad Mladenovic, Daniel Nobre Pinheiro:
On Strategies to Fix Degenerate k-means Solutions. J. Classif. 34(2): 165-190 (2017) - [j17]Leandro Rincon Costa, Daniel Aloise, Nenad Mladenovic:
Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415: 247-253 (2017) - [j16]Artem V. Pyatkin, Daniel Aloise, Nenad Mladenovic:
NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognit. Lett. 97: 44-45 (2017) - 2016
- [j15]Éverton Santi, Daniel Aloise, Simon J. Blanchard:
A model for clustering data from heterogeneous dissimilarities. Eur. J. Oper. Res. 253(3): 659-672 (2016) - 2015
- [j14]Daniel Aloise, Arthur Araujo:
A derivative-free algorithm for refining numerical microaggregation solutions. Int. Trans. Oper. Res. 22(4): 693-712 (2015) - 2014
- [j13]Diogo R. M. Fernandes, Caroline T. M. Rocha, Daniel J. Aloise, Glaydston Mattos Ribeiro, Enilson M. Santos, Allyson Silva:
A simple and effective genetic algorithm for the two-stage capacitated facility location problem. Comput. Ind. Eng. 75: 200-208 (2014) - [j12]João Paulo Queiroz dos Santos, Jorge Dantas de Melo, Adrião Duarte Dória Neto, Daniel Aloise:
Reactive Search strategies using Reinforcement Learning, local search algorithms and Variable Neighborhood Search. Expert Syst. Appl. 41(10): 4939-4949 (2014) - [j11]Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha:
Global optimization workshop 2012. J. Glob. Optim. 60(2): 121-122 (2014) - [j10]Daniel Aloise, Pierre Hansen, Caroline T. M. Rocha, Éverton Santi:
Column generation bounds for numerical microaggregation. J. Glob. Optim. 60(2): 165-182 (2014) - [j9]Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen, Leo Liberti:
On the Weber facility location problem with limited distances and side constraints. Optim. Lett. 8(2): 407-424 (2014) - 2012
- [j8]Daniel Aloise, Pierre Hansen, Leo Liberti:
An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131(1-2): 195-220 (2012) - [j7]Pierre Hansen, Manuel Ruiz, Daniel Aloise:
A VNS heuristic for escaping local extrema entrapment in normalized cut clustering. Pattern Recognit. 45(12): 4337-4345 (2012) - [c1]Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz:
Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering 2012: 113-128 - 2011
- [j6]Daniel Aloise, Celso C. Ribeiro:
Adaptive memory in multistart heuristics for multicommodity network design. J. Heuristics 17(2): 153-179 (2011) - [j5]Daniel Aloise, Pierre Hansen:
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. J. Glob. Optim. 49(3): 449-465 (2011)
2000 – 2009
- 2009
- [j4]Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat:
NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2): 245-248 (2009) - 2008
- [j3]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. Eur. J. Oper. Res. 191(3): 596-611 (2008) - [j2]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur. J. Oper. Res. 191(3): 981-992 (2008) - 2006
- [j1]Dario J. Aloise, Daniel Aloise, Caroline T. M. Rocha, Celso C. Ribeiro, José C. Ribeiro Filho, Luiz S. S. Moura:
Scheduling workover rigs for onshore oil production. Discret. Appl. Math. 154(5): 695-702 (2006)
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-12-02 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint