Results 241 to 250 of about 3,264,220 (298)
"Landmark Route": A Comparison to the Shortest Route [PDF]
, 2022 Most navigation systems for pedestrians output the shortest route. However, there are findings that travellers do not use the shortest route when free to choose. One alternative to minimising spatial distance is the incorporation of landmark information in a shortest route algorithm.
Eva Nuhn, Franziska König, Sabine Timpf
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Routing Optimization for Ensemble Routing
2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, 2011The Ensemble Routing[1] architecture (presented at ANCS 2010) implements multipath routing for data center networks. Rather than managing individual flows, ensemble routing manages flows in groups or ensembles to provide scalable responsive management using simple hardware.
Wenfei Wu +2 more
openaire +1 more source
Routing with compact routing tables
Proceedings of Third International Conference on Electronics, Circuits, and Systems, 2002This paper addresses the problem of reducing the routing information in multicomputer networks. After an overview of the routing problems, the approach followed here is interval routing, initially proposed by Santoro and Khatib, developed by van Leeuwen and Tan and improved by Mugwaneza and Juganaru. Tests and measures are provided for these methods in
Cristina Ioana Geangala +1 more
openaire +1 more source
Stochastic Inventory Routing: Route Design with Stockouts and Route Failures
Transportation Science, 1992The stochastic inventory routing problem involves the distribution of a commodity such as heating oil over a long period of time to a large set of customers. The customers maintain a local inventory of the commodity which they consume at a daily rate.
Pierre Trudeau, Moshe Dror
openaire +1 more source
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies, 2011
Route Aggregation (RA), the method to supersede a set of routes by a single, more general route, is a fundamental mechanism to the Internet scalability. Yet, despite its importance, it is poorly understood. We present the first systematic analysis of RA via both bottom-up experimental and top-down analytical approaches.
Le, Franck, Zhang, Hui, Xie, Geoffrey G.
openaire +2 more sources
Route Aggregation (RA), the method to supersede a set of routes by a single, more general route, is a fundamental mechanism to the Internet scalability. Yet, despite its importance, it is poorly understood. We present the first systematic analysis of RA via both bottom-up experimental and top-down analytical approaches.
Le, Franck, Zhang, Hui, Xie, Geoffrey G.
openaire +2 more sources
Journal of Philosophical Logic, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Susan Rogerson, Greg Restall
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Susan Rogerson, Greg Restall
openaire +1 more source
ACM SIGCOMM Computer Communication Review, 2003
Relentless progress in hardware technology and recent advances in sensor technology, and wireless networking have made it feasible to deploy large scale, dense ad-hoc networks. These networks together with sensor technology can be considered as the enablers of emerging models of computing such as embedded computing, ubiquitous computing, or pervasive ...
Badri Nath, Dragos Niculescu
openaire +1 more source
Relentless progress in hardware technology and recent advances in sensor technology, and wireless networking have made it feasible to deploy large scale, dense ad-hoc networks. These networks together with sensor technology can be considered as the enablers of emerging models of computing such as embedded computing, ubiquitous computing, or pervasive ...
Badri Nath, Dragos Niculescu
openaire +1 more source
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks, 2010
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach called backpressure routing, in which routing and forwarding decisions are made on a per-packet basis.
Scott Moeller +3 more
openaire +1 more source
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach called backpressure routing, in which routing and forwarding decisions are made on a per-packet basis.
Scott Moeller +3 more
openaire +1 more source