Cart (Loading....) | Create Account
Close category search window
 

Response to Tasks of Dynamical Arrival in Sensor Resource Allocation with the Shortest Augmenting Path Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Jianguo Wang ; Dept. of Electron. Eng., Beijing Inst. of Technol. ; Peikun He ; Qi Yuan ; Peikang Huang

A shortest augmenting path (SAP) based sensitivity analysis approach is developed to respond to tasks of dynamical arrival in this paper. The sensor resource allocation problem is formulated as a linear programming problem. Its dual problem and the complementary slackness conditions are given. The SAP algorithm with its computational steps, data structure and computational complexity is presented. The sensitivity analysis of workload is discussed. The computational results show that sensitivity analysis method via SAP is superior to the straightforward method via SAP from scratch in computational performance

Published in:

Signal Processing, 2006 8th International Conference on  (Volume:4 )

Date of Conference:

16-20 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.