952 search results - page 130 / 191 » Computational complexity of stochastic programming problems |
114
click to vote
TCSB
2008
15 years 3 months ago
2008
Abstract. Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems ...
143
click to vote
ICFP
1999
ACM
15 years 7 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
108
click to vote
ICALP
1997
Springer
15 years 7 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
115
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
151
click to vote
IEEESCC
2009
IEEE
15 years 24 days ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...