Decomposition method (constraint satisfaction)
Semantic Scholar uses AI to extract papers important to this topic.
As minimum feature size and pitch spacing further decrease, triple patterning lithography (TPL) is a possible 193nm extension… (More)
- J. Comput. Syst. Sci.
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a… (More)
Constraint satisfaction problems (CSPs) are NP-complete in general, therefore it is important to identify tractable subclasses. A… (More)
In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call a… (More)
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques… (More)
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering… (More)
Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actually… (More)
We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major… (More)
- Biological Cybernetics
We would like to propose a method of single evoked potential (EP) extraction free from assumptions and based on a novel approach… (More)
We describe the Wavelet-Vaguelette Decomposition (WVD) of a linear inverse problem. It is a substitute for the singular value… (More)