2584 search results - page 308 / 517 » On the Forward Checking Algorithm |
120
Voted
DATE
1998
IEEE
15 years 7 months ago
1998
IEEE
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
109
Voted
ECAI
1994
Springer
15 years 6 months ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
120
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
151
Voted
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
STACS
2000
Springer
15 years 6 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...