2008 |
22 | | 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 |
21 | EE | 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 |
20 | EE | Carlos Ansótegui,
Ramón Béjar,
Cèsar Fernández,
Carles Mateu:
From High Girth Graphs to Hard Instances.
CP 2008: 298-312 |
19 | EE | 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 |
2007 |
18 | | Carlos Ansótegui,
Ramón Béjar,
Cèsar Fernández,
Carles Mateu:
On Balanced CSPs with High Treewidth.
AAAI 2007: 161-166 |
17 | EE | Ramón Béjar,
Felip Manyà,
Alba Cabiscol,
Cèsar Fernández,
Carla P. Gomes:
Regular-SAT: A many-valued approach to solving combinatorial problems.
Discrete Applied Mathematics 155(12): 1613-1626 (2007) |
2006 |
16 | | 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 |
2005 |
15 | EE | Ramón Béjar,
Cèsar Fernández,
Carles Mateu:
Statistical Modelling of CSP Solving Algorithms Performance.
CP 2005: 861 |
14 | EE | Casey Smith,
Carla P. Gomes,
Cèsar Fernández:
Streamlining Local Search for Spatially Balanced Latin Squares.
IJCAI 2005: 1539-1540 |
13 | EE | Ramón Béjar,
Carmel Domshlak,
Cèsar Fernández,
Carla P. Gomes,
Bhaskar Krishnamachari,
Bart Selman,
Magda Valls:
Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell. 161(1-2): 117-147 (2005) |
12 | EE | Carla P. Gomes,
Cèsar Fernández,
Bart Selman,
Christian Bessière:
Statistical Regimes Across Constrainedness Regions.
Constraints 10(4): 317-337 (2005) |
2004 |
11 | | Carlos Ansótegui,
Alvaro del Val,
Iván Dotú,
Cèsar Fernández,
Felip Manyà:
Modeling Choices in Quasigroup Completion: SAT vs. CSP.
AAAI 2004: 137-142 |
10 | EE | Carla P. Gomes,
Cèsar Fernández,
Bart Selman,
Christian Bessière:
Statistical Regimes Across Constrainedness Regions.
CP 2004: 32-46 |
2003 |
9 | | Ramón Béjar,
Carmel Domshlak,
Cèsar Fernández,
Carla P. Gomes,
Bart Selman,
Magda Valls:
Grid-based SensorDCSP.
IJCAI 2003: 1359-1361 |
8 | EE | Teresa Alsinet,
Carlos Ansótegui,
Ramón Béjar,
Cèsar Fernández,
Felip Manyà:
Automated monitoring of medical protocols: a secure and distributed architecture.
Artificial Intelligence in Medicine 27(3): 367-392 (2003) |
7 | EE | Bhaskar Krishnamachari,
Stephen B. Wicker,
Ramón Béjar,
Cèsar Fernández:
On the Complexity of Distributed Self-Configuration in Wireless Networks.
Telecommunication Systems 22(1-4): 33-59 (2003) |
2002 |
6 | EE | Teresa Alsinet,
Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà:
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
CCIA 2002: 139-144 |
5 | EE | Cèsar Fernández,
Ramón Béjar,
Bhaskar Krishnamachari,
Carla P. Gomes:
Communication and Computation in Distributed CSP Algorithms.
CP 2002: 664-679 |
2001 |
4 | EE | Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà,
Carla P. Gomes:
Capturing Structure with Satisfiability.
CP 2001: 137-152 |
3 | EE | Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà,
Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics.
Electronic Notes in Discrete Mathematics 9: 392-407 (2001) |
2000 |
2 | EE | Teresa Alsinet,
Ramón Béjar,
Cèsar Fernández,
Felip Manyà:
A Multi-agent system architecture for monitoring medical protocols.
Agents 2000: 499-505 |
1999 |
1 | | Cèsar Fernández,
Sebastià Sallent:
Evaluation of Allocation Policies on Hybrid Fiber-Coax Broadband Access Networks for Contention-Type Traffic.
Broadband Communications 1999: 329-338 |