9842 search results - page 1330 / 1969 » The Complexity of the Matching-Cut Problem |
244
Voted
RTAS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
208
Voted
RV
2010
Springer
15 years 5 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
222
Voted
TKDE
2010
15 years 5 months ago
2010
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
223
Voted
IMC
2010
ACM
15 years 5 months ago
2010
ACM
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
209
click to vote
SECON
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...