18 search results - page 1 / 4 » Complexity of Gradient Projection Method for Optimal Routing... |
INFOCOM
1995
IEEE
13 years 8 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
ADHOC
2008
13 years 4 months ago
2008
In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract--In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integr...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
CLADE
2004
IEEE
13 years 8 months ago
2004
IEEE
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...