A new polynomial-time algorithm for linear programming
Combinatorica
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Inside COM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Maximum RPM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Enterprise-Scale CBD: Building Complex Computer Systems from Components
STEP '99 Proceedings of the Software Technology and Engineering Practice
Component evolution and versioning state of the art
ACM SIGSOFT Software Engineering Notes
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compatible component upgrades through smart component swapping
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
Enhanced Type-based Component Compatibility Using Deployment Context Information
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Component updates always bear the risk of negatively influencing the operativeness of software systems. Due to improper combinations of component versions, dependencies may break. In practise this often turns out to be due to missing or incompatible interfaces and signatures (syntactical interface) but may also be caused by changes in behavior or quality. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. To achieve this, we introduce objective functions and constraints that lead to most recent, minimal systems and use Branch-and-Bound to restrict the search space.