9842 search results - page 420 / 1969 » The Complexity of the Matching-Cut Problem |
172
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
145
click to vote
CORR
2008
Springer
15 years 4 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...
148
click to vote
TOCL
2011
14 years 11 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...
160
click to vote
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
176
click to vote
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...