1768 search results - page 121 / 354 » Optimal routing in Chord |
114
click to vote
SCHEDULING
2008
15 years 21 days ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
118
click to vote
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—We consider a Ferry based Wireless Local Area Network (FWLAN), in which information is forwarded from a base station to sensors, or gathered from sensors to a base station using...
101
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
126
click to vote
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
121
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...