Sciweavers

1093 search results - page 119 / 219
» Probabilistic Location and Routing
Sort
View
COR
2010
152views more  COR 2010»
15 years 4 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
125
Voted
JUCS
2008
98views more  JUCS 2008»
15 years 3 months ago
Spatial Queries in Road Networks Based on PINE
: Over the last decade, due to the rapid developments in information technology (IT), a new breed of information systems has appeared such as geographic information systems that in...
Maytham Safar
127
Voted
PE
2006
Springer
127views Optimization» more  PE 2006»
15 years 3 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
IJAHUC
2010
114views more  IJAHUC 2010»
15 years 2 months ago
Malugo: A peer-to-peer storage system
: We consider the problem of routing locality in peer-to-peer storage systems where peers store and exchange data among themselves. With the global information, peers will take the...
Yu-Wei Chan, Tsung-Hsuan Ho, Po-Chi Shih, Yeh-Chin...
GI
2009
Springer
15 years 1 months ago
An Application for Simulations at Large Pickup and Delivery Service Providers
: Over time, large scale pickup and delivery providers acquire considerable amounts of data on customer orders, including order times, amount and configurations of freight, as well...
Curt Nowak, Klaus Ambrosi, Felix Hahne