Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

58

AAAI
2008

100views Intelligent Agents» more AAAI 2008»

Generating Hard SAT/CSP Instances Using Expander Graphs

15 years 5 months ago

Generating Hard SAT/CSP Instances Using Expander Graphs

Download www.aaai.org

Carlos Ansótegui, Ramón Béjar

Real-time Traffic

AAAI 2008 | Intelligent Agents |

claim paper

Related Content

» Approximating TSP Solution by MST Based Graph Pyramid

» Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring

» How to Play Unique Games against a SemiRandom Adversary

» A CostRegular Based Hybrid Column Generation Approach

» Cloningbased contextsensitive pointer alias analysis using binary decision diagrams

» DataDependency Graph Transformations for Superblock Scheduling

» Fast and accurate estimation of shortest paths in large graphs

» VariableDimensional Optimization with Evolutionary Algorithms Using FixedLength Representa...

» Evolving petri nets to represent metabolic pathways

Post Info
More Details (n/a)

Added	02 Oct 2010
Updated	02 Oct 2010
Type	Conference
Year	2008
Where	AAAI
Authors	Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Comments (0)