521 search results - page 8 / 105 » Reduction Strategies and Acyclicity |
SC
2003
ACM
14 years 1 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
JAIR
2008
13 years 7 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
DLOG
2011
12 years 11 months ago
2011
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
CDC
2009
IEEE
14 years 16 days ago
2009
IEEE
— In general, existing model reduction techniques for stable nonlinear systems lack a guarantee on stability of the reduced-order model, as well as an error bound. In this paper,...