Joined
Last Seen
0 Reputation Points
0% Quality Score
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 6
- Posts with Downvotes
- 3
- Downvoting Members
- 4
0 Endorsements
Ranked #72.7K
|
This is a program I just recently completed for a computer science course. Given a 2D grid, where every path between two gridpoints has a weight (path length) associated with it, this program computes the shortest path from (1,1) to (m,n). You are only allowed to move up and to … 
|
|
|
Algorithm 1 Distributed Algorithm (at each node Si, i E N) Input: the neighbor set N(Si), the neighboring schedules, the critical location set Pi that Si covers, the importance factor of each location Pi, i E Pi, network lifetime L, battery life Bi, Si is initially unlabeled Output: the state … 
|