The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2008  
         
  Article:   CONSTRAINT OPTIMIZATION-BASED COMPONENT SELECTION PROBLEM.

Authors:  ANDREEA VESCAN, HORIA F. POP.
 
       
         
  Abstract:  Component-Based Software Engineering (CBSE) is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific requirements. Component selection and component assembly have become two of the key issues involved in this process.
   We aim at a selection approach that guarantees the optimality of the generated component-based systems, an approach that considers at each step the cost of the selected component and the set of requirements remaining to be satisfied. The dependencies between requirements are also considered. We have modeled the Component Selection Problem as a Constraint Satisfaction Optimization Problem and applied the Branch and Bound algorithm. The experiments and comparisons with the Greedy algorithm show the effectiveness of the proposed approach.

Key words and phrases. Component selection problem, Constraint Satisfaction Optimization Problem, Automatic assembly.
 
         
     
         
         
      Back to previous page