{"id":"https://openalex.org/W2136530483","doi":"https://doi.org/10.1109/iri.2009.5211598","title":"Generation of pairwise test sets using a simulated bee colony algorithm","display_name":"Generation of pairwise test sets using a simulated bee colony algorithm","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2136530483","doi":"https://doi.org/10.1109/iri.2009.5211598","mag":"2136530483"},"language":"en","primary_location":{"id":"doi:10.1109/iri.2009.5211598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2009.5211598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Information Reuse & Integration","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103716284","display_name":"James McCaffrey","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"James D. McCaffrey","raw_affiliation_strings":["Microsoft MSDN/Volt VTE","Microsoft MSDN / Volt VTE, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft MSDN/Volt VTE","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft MSDN / Volt VTE, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103716284"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":5.4291,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.9606332,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.9202520847320557},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7451604604721069},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6032655239105225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5780230164527893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.522377073764801},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.45201146602630615},{"id":"https://openalex.org/keywords/test-set","display_name":"Test set","score":0.42823854088783264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37967348098754883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29337799549102783},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23958781361579895}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.9202520847320557},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7451604604721069},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6032655239105225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5780230164527893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.522377073764801},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.45201146602630615},{"id":"https://openalex.org/C169903167","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Test set","level":2,"score":0.42823854088783264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37967348098754883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29337799549102783},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23958781361579895},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iri.2009.5211598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2009.5211598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Information Reuse & Integration","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W5124408","https://openalex.org/W16088600","https://openalex.org/W186126380","https://openalex.org/W1524216132","https://openalex.org/W1607022282","https://openalex.org/W1894930292","https://openalex.org/W2000254368","https://openalex.org/W2086665685","https://openalex.org/W2115358779","https://openalex.org/W2115455009","https://openalex.org/W2122796178","https://openalex.org/W2123207809","https://openalex.org/W3138355580","https://openalex.org/W3154486830","https://openalex.org/W4206915417","https://openalex.org/W6631389943","https://openalex.org/W6678141853","https://openalex.org/W6792741644"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2378211422","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W2154177135","https://openalex.org/W2252747487","https://openalex.org/W4307413935","https://openalex.org/W3158697290","https://openalex.org/W4318718858"],"abstract_inverted_index":{"Pairwise":[0],"testing":[1,22,140],"is":[2,27,40,129],"a":[3,16,37,62,124],"combinatorial":[4],"technique":[5],"used":[6],"to":[7,15,68],"reduce":[8],"the":[9,54,75,97,117,134],"number":[10],"of":[11,32,56,90,119],"test":[12,34,59,81,121,144],"case":[13],"inputs":[14,26],"system":[17],"in":[18,88,110,139],"situations":[19],"where":[20,142],"exhaustive":[21],"with":[23,36],"all":[24,93,111],"possible":[25],"not":[28],"feasible.":[29],"The":[30,113],"generation":[31,105,118],"pairwise":[33,58,120,143],"sets":[35,60,82,122],"minimal":[38],"size":[39,91],"an":[41],"NP-complete":[42],"problem":[43],"and":[44,131],"several":[45],"deterministic":[46,108],"algorithms":[47],"have":[48],"been":[49],"published.":[50],"This":[51],"paper":[52],"presents":[53],"results":[55,70,114],"generating":[57],"using":[61,123],"simulated":[63,76,98,125],"bee":[64,77,99,126],"colony":[65,78,100,127],"algorithm.":[66],"Compared":[67],"published":[69],"for":[71,92],"seven":[72,94],"benchmark":[73],"problems,":[74],"approach":[79,101,135],"produced":[80],"which":[83],"were":[84],"comparable":[85],"or":[86],"better":[87],"terms":[89],"problems.":[95],"However,":[96],"required":[102],"significantly":[103],"longer":[104],"time":[106],"than":[107],"approaches":[109],"cases.":[112],"demonstrate":[115],"that":[116,133],"algorithm":[128],"possible,":[130],"suggest":[132],"may":[136],"be":[137,148],"useful":[138],"scenarios":[141],"set":[145],"data":[146],"will":[147],"reused.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}