334 search results - page 55 / 67 » Inapproximability of Survivable Networks |
WEBI
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we propose a methodology to predict the popularity of online contents. More precisely, rather than trying to infer the popularity of a content itself, we infer the l...
JSAC
2010
13 years 3 months ago
2010
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
CHI
2007
ACM
14 years 9 months ago
2007
ACM
Massively multiplayer online games (MMOGs) can be fascinating laboratories to observe group dynamics online. In particular, players must form persistent associations or "guil...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
Under highly security vulnerable, resource restricted, and dynamically changing mobile ad hoc environments, it is critical to be able to maximize the system lifetime while boundin...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...