Cèsar Fernández

According to our database1, Cèsar Fernández authored at least 42 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships.
Pattern Recognit. Lett., 2018

2017
Weighted argumentation for analysis of discussions in Twitter.
Int. J. Approx. Reason., 2017

2016
A predictor model for the composting process on an industrial scale based on Markov processes.
Environ. Model. Softw., 2016

Non existence of some mixed Moore graphs of diameter 2 using SAT.
Discret. Math., 2016

On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.
Ann. Math. Artif. Intell., 2016

Support Analysis of Weighted Discussions in Twitter.
Proceedings of the Artificial Intelligence Research and Development, 2016

2015
Approximate dynamic programming for automated vacuum waste collection systems.
Environ. Model. Softw., 2015

Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.
AI Commun., 2015

2014
Modeling energy consumption in automated vacuum waste collection systems.
Environ. Model. Softw., 2014

2013
On the hardness of solving edge matching puzzles as SAT or CSP problems.
Constraints An Int. J., 2013

Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.
Proceedings of the Artificial Intelligence Research and Development, 2013

2012
The Sudoku completion problem with rectangular hole pattern is NP-complete.
Discret. Math., 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

The Automated Vacuum Waste Collection Optimization Problem.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Generating highly balanced sudoku problems as hard problems.
J. Heuristics, 2011

Towards an Efficient Use of Resources in All-Optical Networks.
Proceedings of the Artificial Intelligence Research and Development, 2011

On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems.
Proceedings of the Artificial Intelligence Research and Development, 2011

2010
Solving Pseudo-Boolean Modularity Constraints.
Proceedings of the ECAI 2010, 2010

Encoding Basic Arithmetic Operations for SAT-Solvers.
Proceedings of the Artificial Intelligence Research and Development, 2010

2009
Bounding the Phase Transition on Edge Matching Puzzles.
Proceedings of the ISMVL 2009, 2009

2008
Hard SAT and CSP instances with Expander Graphs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Edge Matching Puzzles as Hard SAT/CSP Benchmarks.
Proceedings of the Principles and Practice of Constraint Programming, 2008

From High Girth Graphs to Hard Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2008

How Hard is a Commercial Puzzle: the Eternity II Challenge.
Proceedings of the Artificial Intelligence Research and Development, 2008

Generating Hard SAT/CSP Instances Using Expander Graphs.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Regular-SAT: A many-valued approach to solving combinatorial problems.
Discret. Appl. Math., 2007

On Balanced CSPs with High Treewidth.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
The Impact of Balancing on Problem Hardness in a Highly Structured Domain.
Proceedings of the Proceedings, 2006

2005
Statistical Regimes Across Constrainedness Regions.
Constraints An Int. J., 2005

Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell., 2005

Streamlining Local Search for Spatially Balanced Latin Squares.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Statistical Modelling of CSP Solving Algorithms Performance.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Modeling Choices in Quasigroup Completion: SAT vs. CSP.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
On the Complexity of Distributed Self-Configuration in Wireless Networks.
Telecommun. Syst., 2003

Automated monitoring of medical protocols: a secure and distributed architecture.
Artif. Intell. Medicine, 2003

Grid-based SensorDCSP.
Proceedings of the IJCAI-03, 2003

2002
Communication and Computation in Distributed CSP Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

2001
Extending the Reach of SAT with Many-Valued Logics.
Electron. Notes Discret. Math., 2001

Capturing Structure with Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
A Multi-agent system architecture for monitoring medical protocols.
Proceedings of the Fourth International Conference on Autonomous Agents, 2000

1999
Evaluation of Allocation Policies on Hybrid Fiber-Coax Broadband Access Networks for Contention-Type Traffic.
Proceedings of the Broadband Communications: Convergence of Network Technologies, 1999


  Loading...