Name
Abstract | ||
|---|---|---|
In this paper, we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with minimizing the mean squared error (MSE), are based on the convex relaxation approach to address the binary optimization scheduling problems that are formulated ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TSP.2017.2773429 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
Time measurement,Estimation,Signal processing algorithms,Optimization,Size measurement,Scheduling,Pollution measurement | Fixed-priority pre-emptive scheduling,Mathematical optimization,Fair-share scheduling,Scheduling (computing),Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Mathematics | Journal |
Volume | Issue | ISSN |
66 | 2 | 1053-587X |
Citations | PageRank | References |
3 | 0.43 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristian Rusu | 1 | 399 | 45.44 |
| John S. Thompson | 2 | 32 | 11.59 |
| Neil M. Robertson | 3 | 323 | 29.25 |