1095 search results - page 35 / 219 » Preprocessing of Intractable Problems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
TOCL
2011
13 years 2 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
EOR
2008
13 years 7 months ago
2008
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
FSS
2008
13 years 7 months ago
2008
In the field of classification problems, we often encounter classes with a very different percentage of patterns between them, classes with a high pattern percentage and classes w...
DATAMINE
2007
13 years 7 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...