Search Sciweavers | Sciweavers

This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...

Miguel F. Anjos

claim paper

Read More »

112

click to vote

DKE
2007

70views more DKE 2007»

Extending the state-of-the-art of constraint-based pattern discovery

15 years 6 months ago

Download hpc.isti.cnr.it

Francesco Bonchi, Claudio Lucchese

claim paper

Read More »

136

click to vote

JSW
2008

83views more JSW 2008»

Extending Component Composition Using Model Driven and Aspect-Oriented Techniques

15 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers