Sciweavers

1388 search results - page 39 / 278
» Approximability of Robust Network Design
Sort
View
NN
2010
Springer
187views Neural Networks» more  NN 2010»
13 years 2 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
INFOCOM
2002
IEEE
14 years 15 days ago
A Robust Acknowledgement Scheme for Unreliable Flows
Abstract—The increasing presence of UDP traffic in the Internet and the emergence of sensing applications which do not require full reliability motivates the search for a robust...
Hoi-sheung Wilson So, Ye Xia, Jean C. Walrand
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
13 years 9 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
CN
2011
111views more  CN 2011»
12 years 11 months ago
On the design of network control and management plane
We provide a design of a control and management plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of a logically centralized...
Hammad Iqbal, Taieb Znati
WSC
2008
13 years 10 months ago
Research and analysis of simulation-based networks through multi-objective visualization
Visualization of individual network events is a crucial part of testing new network designs and analyzing network performance and efficiency. This research designed and developed ...
J. Mark Belue, Stuart H. Kurkowski, Scott R. Graha...