236 search results - page 22 / 48 » On the Vehicle Routing Problem with lower bound capacities |
159
click to vote
AIPS
2008
15 years 8 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
219
click to vote
NETWORKING
2011
14 years 9 months ago
2011
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...
174
click to vote
SIAMDM
2010
15 years 24 days ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
213
click to vote
MOBIHOC
2004
ACM
16 years 5 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
174
click to vote
ICC
2007
IEEE
16 years 11 days ago
2007
IEEE
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...