In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that isâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- Bei Yu, Kun Yuan, Boyang Zhang, Duo Ding, David Z. Pan
- IEEE Transactions on Computer-Aided Design ofâ€¦
- 2011

As minimum feature size and pitch spacing further decrease, triple patterning lithography (TPL) is a possible 193nm extensionâ€¦Â (More)

Is this relevant?

2008

2008

- David A. Cohen, Peter Jeavons, Marc Gyssens
- J. Comput. Syst. Sci.
- 2008

In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call aâ€¦Â (More)

Is this relevant?

2008

2008

- ZoltÃ¡n MiklÃ³s
- 2008

Constraint satisfaction problems (CSPs) are NP-complete in general, therefore it is important to identify tractable subclasses. Aâ€¦Â (More)

Is this relevant?

2005

2005

A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition

- David A. Cohen, Peter Jeavons, Marc Gyssens
- IJCAI
- 2005

In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call aâ€¦Â (More)

Is this relevant?

2004

2004

- Yaling Zheng, Berthe Y. Choueiry
- CSCLP
- 2004

We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniquesâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Rina Dechter, Kalev Kask, Robert Mateescu
- UAI
- 2002

The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clusteringâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Georg Gottlob, Nicola Leone, Francesco Scarcello
- SEBD
- 1999

Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actuallyâ€¦Â (More)

Is this relevant?

Review

1999

Review

1999

- Georg Gottlob, Nicola Leone, Francesco Scarcello
- IJCAI
- 1999

We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the majorâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- E. A. Bartnik, Katarzyna J. Blinowska, Piotr J. Durka
- Biological Cybernetics
- 1992

We would like to propose a method of single evoked potential (EP) extraction free from assumptions and based on a novel approachâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- David L. Donoho
- 1992

We describe the Wavelet-Vaguelette Decomposition (WVD) of a linear inverse problem. It is a substitute for the singular valueâ€¦Â (More)

Is this relevant?