@inproceedings{84947729461,
    abstract = "© Springer-Verlag Berlin Heidelberg 2006.Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.",
    year = "2006",
    title = "Identifying “interesting” component assemblies for NFRs using imperfect information",
    volume = "4344",
    pages = "204-211",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Pereira, Javier Lino Monteagudo and López, Claudia and Astudillo, Hernán"
}

{"_id":"dcrH7cn2KMacLnwAG","bibbaseid":"pereira-lpez-astudillo-identifyinginterestingcomponentassembliesfornfrsusingimperfectinformation-2006","downloads":0,"creationDate":"2017-04-03T15:16:25.480Z","title":"Identifying “interesting” component assemblies for NFRs using imperfect information","author_short":["Pereira, J. L. M.","López, C.","Astudillo, H."],"year":2006,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"© Springer-Verlag Berlin Heidelberg 2006.Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.","year":"2006","title":"Identifying “interesting” component assemblies for NFRs using imperfect information","volume":"4344","pages":"204-211","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Pereira"],"firstnames":["Javier","Lino","Monteagudo"],"suffixes":[]},{"propositions":[],"lastnames":["López"],"firstnames":["Claudia"],"suffixes":[]},{"propositions":[],"lastnames":["Astudillo"],"firstnames":["Hernán"],"suffixes":[]}],"bibtex":"@inproceedings{84947729461,\n abstract = \"© Springer-Verlag Berlin Heidelberg 2006.Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.\",\n year = \"2006\",\n title = \"Identifying “interesting” component assemblies for NFRs using imperfect information\",\n volume = \"4344\",\n pages = \"204-211\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n author = \"Pereira, Javier Lino Monteagudo and López, Claudia and Astudillo, Hernán\"\n}\n\n","author_short":["Pereira, J. L. M.","López, C.","Astudillo, H."],"key":"84947729461","id":"84947729461","bibbaseid":"pereira-lpez-astudillo-identifyinginterestingcomponentassembliesfornfrsusingimperfectinformation-2006","role":"author","urls":{},"downloads":0},"search_terms":["identifying","interesting","component","assemblies","nfrs","using","imperfect","information","pereira","lópez","astudillo"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}