Sciweavers

1450 search results - page 281 / 290
» On the Complexity of Hardness Amplification
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
IMC
2010
ACM
13 years 5 months ago
What happened in my network: mining network events from router syslogs
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
Tongqing Qiu, Zihui Ge, Dan Pei, Jia Wang, Jun Xu
IMC
2010
ACM
13 years 5 months ago
Eyeball ASes: from geography to connectivity
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...
Amir H. Rasti, Nazanin Magharei, Reza Rejaie, Walt...
IWCMC
2010
ACM
13 years 5 months ago
Dynamic load balancing and throughput optimization in 3GPP LTE networks
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
Hao Wang, Lianghui Ding, Ping Wu, Zhiwen Pan, Nan ...
MOBIHOC
2010
ACM
13 years 5 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...