4843 search results - page 597 / 969 » The Shortcut Problem - Complexity and Approximation |
149
Voted
TIP
2002
15 years 4 months ago
2002
In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image r...
143
click to vote
CORR
2010
Springer
15 years 3 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...
128
click to vote
FUIN
2010
15 years 3 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...
167
click to vote
ICST
2010
IEEE
15 years 3 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...
144
click to vote
INFOCOM
2010
IEEE
15 years 3 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 ...