33 search results - page 7 / 7 » Information Relaxations and Duality in Stochastic Dynamic Pr... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
TASE
2008
IEEE
13 years 5 months ago
2008
IEEE
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
COMSWARE
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...