909 search results - page 39 / 182 » On the approximability of some network design problems |
113
click to vote
RSFDGRC
2005
Springer
15 years 7 months ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
223
click to vote
DAC
2011
ACM
14 years 1 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
157
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
123
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...
WSC
2004
15 years 2 months ago
2004
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...