1204 search results - page 186 / 241 » Termination of Polynomial Programs |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
CAV
2003
Springer
15 years 3 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...