![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 7 | 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 | |
| 6 | 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 | |
| 5 | Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: From High Girth Graphs to Hard Instances. CP 2008: 298-312 | |
| 4 | 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 | |
| 3 | Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On Balanced CSPs with High Treewidth. AAAI 2007: 161-166 | |
| 2 | 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 | |
| 1 | Ramón Béjar, Cèsar Fernández, Carles Mateu: Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861 |
Selection of 7 from 7 records - Carles Mateu has 4 coauthors
Copyright © 2009-12-29 by Michael Ley (ley@uni-trier.de)