An Information Retrieval Approach for Automatically Constructing Software Libraries
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
A case study in applying a systematic method for COTS selection
Proceedings of the 18th international conference on Software engineering
Software reuse: metrics and models
ACM Computing Surveys (CSUR)
Storing and retrieving software components: a refinement based system
ICSE '94 Proceedings of the 16th international conference on Software engineering
Observations on the complexity of composable simulation
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Specification-Based Component Retrieval
Automated Software Engineering
An Empirical Study of Representation Methods for Reusable Software Components
IEEE Transactions on Software Engineering
A semantic-based approach to component retrieval
ACM SIGMIS Database
Verified systems by composition from verified components
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Approximating component selection
WSC '04 Proceedings of the 36th conference on Winter simulation
Using goals and quality models to support the matching analysis during COTS selection
ICCBSS'05 Proceedings of the 4th international conference on COTS-Based Software Systems
Requirements for DDDAS flexible point support
Proceedings of the 38th conference on Winter simulation
Observations on new developments in composability and multi-resolution modeling
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Distributed management of elements for modeling and simulation of heterogeneous models
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Hi-index | 0.01 |
Simulation composability has been much more difficult to realize than some initially imagined. We believe that success lies in explicit considerations for the adaptability of components. In this paper we show that the complexity of optimal component selection for adaptable components is NP-complete. However, our approach allows for the efficient adaptation of components to construct a complex simulation in the most flexible manner while allowing the greatest opportunity to meet all requirements, all the while reducing time and costs. We demonstrate that complexity can vary from polynomial, to NP, and even to exponential as a function of seemingly simple decisions made about the nature of dependencies among components. We generalize these results to show that regardless of the types or reasons for dependencies in component selection, just their mere existence makes this problem very difficult to solve optimally.