Pages that link to "Item:Q2637590"
From MaRDI portal
The following pages link to Optimal periodic scheduling of sensor networks: a branch and bound approach (Q2637590):
Displaying 11 items.
- Periodicity of Kalman-based scheduled filters (Q472602) (← links)
- Scheduling parallel Kalman filters with quantized deadlines (Q893476) (← links)
- Optimal multiple-sensor scheduling for general scalar Gauss-Markov systems with the terminal error (Q1678567) (← links)
- Optimal capacity allocation for sampled networked systems (Q1679839) (← links)
- On fractional derivatives and primitives of periodic functions (Q1724012) (← links)
- A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features (Q2150469) (← links)
- A complete greedy algorithm for infinite-horizon sensor scheduling (Q2409254) (← links)
- Approximate optimal periodic scheduling of multiple sensors with constraints (Q2445166) (← links)
- Branch and bound method for sensor scheduling in discrete time (Q2583324) (← links)
- Sensor selection for remote state estimation with QoS requirement constraints (Q6073042) (← links)
- Optimal periodic sensor scheduling for minimizing communication rate under LQG constraint (Q6136136) (← links)
