( en | de | ru )

 

Disambiguation of "Mateu, Carles"

Author of the publication

copydeleteadd this publication to your clipboard
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.

, , , , and . ICTAI, page 291-298. IEEE Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rafael Hernán Mateus Vargas

Sara Mateus Fernández

Carles Ulises Moulines

Carles Ossorio-Capella

Joan Carles Elvira Husé

 

Other publications of authors with the same name

Bounding the Phase Transition on Edge Matching Puzzles., , , and . ISMVL, page 80-85. IEEE Computer Society, (2009)Explainable Machine Learning Models for Predicting COVID-19 Cases in Catalonia Based on Wastewater Monitoring Data., , , , , and . CCIA, volume 375 of Frontiers in Artificial Intelligence and Applications, page 262-266. IOS Press, (2023)Edge Matching Puzzles as Hard SAT/CSP Benchmarks., , , and . CP, volume 5202 of Lecture Notes in Computer Science, page 560-565. Springer, (2008)The rise of machine learning for detection and classification of malware: Research developments, trends and challenges., , and . J. Netw. Comput. Appl., (2020)CSP problems as algorithmic benchmarks: measures, methods and models.. University of Lleida, Spain, (2009)HYDRA: A multimodal deep learning framework for malware classification., , and . Comput. Secur., (2020)The Impact of Balancing on Problem Hardness in a Highly Structured Domain., , , , and . AAAI, page 10-15. AAAI Press, (2006)On Balanced CSPs with High Treewidth., , , and . AAAI, page 161-166. AAAI Press, (2007)Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers., , , and . CCIA, volume 256 of Frontiers in Artificial Intelligence and Applications, page 60-63. IOS Press, (2013)Generating highly balanced sudoku problems as hard problems., , , , and . J. Heuristics, 17 (5): 589-614 (2011)