default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarles Mateu
- > Home > Persons > Carles Mateu
Publications
- 2023
[c23]Marc Ribalta, Josep Pueyo-Ros, Lluís Corominas, Ramón Béjar, Carles Mateu, Edgar Rubión:
Explainable Machine Learning Models for Predicting COVID-19 Cases in Catalonia Based on Wastewater Monitoring Data. CCIA 2023: 262-266- 2018
- [j10]Teresa Alsinet
, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships. Pattern Recognit. Lett. 105: 191-199 (2018) - 2017
- [j9]Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
Weighted argumentation for analysis of discussions in Twitter. Int. J. Approx. Reason. 85: 21-35 (2017) - 2016
- [j8]Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes. Ann. Math. Artif. Intell. 77(1-2): 43-66 (2016) - [c16]Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
Support Analysis of Weighted Discussions in Twitter. CCIA 2016: 197-206 - 2015
- [j6]Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu:
Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers. AI Commun. 28(1): 21-34 (2015) - 2013
- [j3]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints An Int. J. 18(1): 7-37 (2013) - [c15]Ramón Béjar, Cèsar Fernández, Carles Mateu, Francesc Guitart:
Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers. CCIA 2013: 60-63 - 2012
- [j2]Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls:
The Sudoku completion problem with rectangular hole pattern is NP-complete. Discret. Math. 312(22): 3306-3315 (2012) - [c14]Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal:
The Automated Vacuum Waste Collection Optimization Problem. AAAI 2012: 264-266 - [c13]Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri:
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI 2012: 291-298 - 2011
- [j1]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu:
Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5): 589-614 (2011) - [c12]Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems. CCIA 2011: 21-30 - [c11]Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu:
Towards an Efficient Use of Resources in All-Optical Networks. CCIA 2011: 61-70 - 2010
- [c10]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu:
Solving Pseudo-Boolean Modularity Constraints. ECAI 2010: 867-872 - 2009
- [c9]Ramón Béjar, Cèsar Fernández, Carles Mateu, Nuria Pascual:
Bounding the Phase Transition on Edge Matching Puzzles. ISMVL 2009: 80-85 - 2008
- [c8]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Generating Hard SAT/CSP Instances Using Expander Graphs. AAAI 2008: 1442-1443 - [c7]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
How Hard is a Commercial Puzzle: the Eternity II Challenge. CCIA 2008: 99-108 - [c6]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
From High Girth Graphs to Hard Instances. CP 2008: 298-312 - [c5]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Edge Matching Puzzles as Hard SAT/CSP Benchmarks. CP 2008: 560-565 - [c4]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Hard SAT and CSP instances with Expander Graphs. ISAIM 2008 - 2007
- [c3]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On Balanced CSPs with High Treewidth. AAAI 2007: 161-166 - 2006
- [c2]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu:
The Impact of Balancing on Problem Hardness in a Highly Structured Domain. AAAI 2006: 10-15 - 2005
- [c1]Ramón Béjar, Cèsar Fernández, Carles Mateu:
Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861
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 20: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:
