9949 search results - page 105 / 1990 » On the Network Complexity of Selection |
INFOCOM
1995
IEEE
14 years 14 days 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...
AUSAI
2003
Springer
14 years 2 months ago
2003
Springer
Behavior-based artificial intelligent system is to derive the complicated behaviors by selecting appropriate one from a set of basic behaviors. Many robot systems have used behavi...
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained ...
AINA
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—We describe a Bayesian formalism for the intelligent selection of observations from sensor networks that may intermittently undergo faults or changepoints. Such active d...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional pa...