A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
Decentralized discovery of free parking places
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
VANET-based approach for parking space availability
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
ParkNet: a mobile sensor network for harvesting real time vehicular parking information
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
ParkNet: drive-by sensing of road-side parking statistics
Proceedings of the 8th international conference on Mobile systems, applications, and services
| Hi-index | 0.00 |
We discuss the problem of predicting the number of available parking spaces in a parking lot. The parking lot is modeled by a continuous-time Markov chain, following Caliskan, Barthels, Scheuermann, and Mauve. The parking lot regularly communicates the number of occupied spaces, capacity, arrival and parking rate through a vehicular ad-hoc network. The navigation system in the vehicle has to compute from this data the probability of an available parking space upon arrival. We derive a structural result that considerably simplifies the computation of the transition probabilities in the navigation system of the vehicle.