1461 search results - page 168 / 293 » Complexity of Graph Covering Problems |
208
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
118
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
103
click to vote
CBMS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper focuses on the problem of representing, in a meaningful way, the knowledge involved in the HealthAgents project. Our work is motivated by the complexity of representing...
110
click to vote
DSD
2007
IEEE
15 years 8 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
131
click to vote
DSN
2003
IEEE
15 years 7 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...