Sciweavers

854 search results - page 108 / 171
» A General Vehicle Routing Problem
Sort
View
ANCS
2005
ACM
14 years 1 months ago
A novel reconfigurable hardware architecture for IP address lookup
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
Hamid Fadishei, Morteza Saheb Zamani, Masoud Sabae...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
SIGCOMM
2010
ACM
13 years 8 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
SPAA
2003
ACM
14 years 29 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ICRA
2009
IEEE
138views Robotics» more  ICRA 2009»
14 years 2 months ago
Which landmark is useful? Learning selection policies for navigation in unknown environments
Abstract— In general, a mobile robot that operates in unknown environments has to maintain a map and has to determine its own location given the map. This introduces significant...
Hauke Strasdat, Cyrill Stachniss, Wolfram Burgard