625 search results - page 66 / 125 » Approximating Travel Times Using Opportunistic Networking |
144
click to vote
QEST
2009
IEEE
15 years 10 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
115
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
116
Voted
TMC
2011
14 years 10 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
140
click to vote
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
158
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...