4894 search results - page 608 / 979 » The Guarding Problem - Complexity and Approximation |
136
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
126
click to vote
FUIN
2010
15 years 2 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
164
click to vote
ICST
2010
IEEE
15 years 2 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
142
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
145
click to vote
PVLDB
2010
15 years 2 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...