2008 |
25 | | 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 |
24 | 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 |
23 | 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 |
22 | 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 |
21 | | Carlos Ansótegui,
Ramón Béjar,
Cèsar Fernández,
Carles Mateu:
On Balanced CSPs with High Treewidth.
AAAI 2007: 161-166 |
20 | 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 |
19 | | 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 |
18 | EE | Ramón Béjar,
Cèsar Fernández,
Carles Mateu:
Statistical Modelling of CSP Solving Algorithms Performance.
CP 2005: 861 |
17 | 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) |
2004 |
16 | EE | Carlos Ansótegui,
Ramón Béjar,
Alba Cabiscol,
Felip Manyà:
The Interface between P and NP in Signed CNF Formulas.
ISMVL 2004: 251-256 |
2003 |
15 | | Ramón Béjar,
Carmel Domshlak,
Cèsar Fernández,
Carla P. Gomes,
Bart Selman,
Magda Valls:
Grid-based SensorDCSP.
IJCAI 2003: 1359-1361 |
14 | 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) |
13 | 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 |
12 | 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 |
11 | 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 |
10 | EE | Bhaskar Krishnamachari,
Ramón Béjar,
Stephen B. Wicker:
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks.
HICSS 2002: 297 |
2001 |
9 | EE | Ramón Béjar,
Alba Cabiscol,
Cèsar Fernández,
Felip Manyà,
Carla P. Gomes:
Capturing Structure with Satisfiability.
CP 2001: 137-152 |
8 | | Ramón Béjar,
Reiner Hähnle,
Felip Manyà:
A Modular Reduction of Regular Logic to Classical Logic.
ISMVL 2001: 221-226 |
7 | 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 |
6 | | Ramón Béjar,
Felip Manyà:
Solving the Round Robin Problem Using Propositional Logic.
AAAI/IAAI 2000: 262-266 |
5 | 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 |
4 | EE | Ramón Béjar,
Felip Manyà:
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas.
ESCQARU 1999: 22-31 |
3 | | Ramón Béjar,
Felip Manyà:
Phase Transitions in the Regular Random 3-SAT Problem.
ISMIS 1999: 292-300 |
2 | | Ramón Béjar,
Felip Manyà:
Solving Combinatorial Problems with Regular Local Search Algorithms.
LPAR 1999: 33-43 |
1998 |
1 | EE | Felip Manyà,
Ramón Béjar,
Gonzalo Escalada-Imaz:
The satisfiability problem in regular CNF-formulas.
Soft Comput. 2(3): 116-123 (1998) |