{"id":"https://openalex.org/W2785546610","doi":"https://doi.org/10.1109/ssci.2017.8285451","title":"Parameterized analysis of bio-inspired computing","display_name":"Parameterized analysis of bio-inspired computing","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2785546610","doi":"https://doi.org/10.1109/ssci.2017.8285451","mag":"2785546610"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8285451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19984816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"[22]","issue":null,"first_page":"1","last_page":"3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8547157645225525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7705444097518921},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5966255068778992},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5606679916381836},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5225077271461487},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5028948187828064},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.45761531591415405},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39234820008277893},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38455522060394287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29374444484710693}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8547157645225525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7705444097518921},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5966255068778992},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5606679916381836},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5225077271461487},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5028948187828064},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.45761531591415405},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39234820008277893},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38455522060394287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29374444484710693},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ssci.2017.8285451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/111916","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/111916","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8267146","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W116475295","https://openalex.org/W815914887","https://openalex.org/W1484234309","https://openalex.org/W1512383952","https://openalex.org/W1573676079","https://openalex.org/W1631204983","https://openalex.org/W1915652795","https://openalex.org/W1988607827","https://openalex.org/W2031283589","https://openalex.org/W2075813565","https://openalex.org/W2079241742","https://openalex.org/W2083515646","https://openalex.org/W2086054344","https://openalex.org/W2088415500","https://openalex.org/W2110786553","https://openalex.org/W2146312568","https://openalex.org/W2251503907","https://openalex.org/W2330374543","https://openalex.org/W2336254308","https://openalex.org/W2548980221","https://openalex.org/W2588991741","https://openalex.org/W2726056738","https://openalex.org/W2731672985","https://openalex.org/W2785385648","https://openalex.org/W2913688336","https://openalex.org/W2962809967","https://openalex.org/W2962958080","https://openalex.org/W3004042307","https://openalex.org/W4292230561","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W2155027171","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W4388276051","https://openalex.org/W2953291322","https://openalex.org/W2391924736","https://openalex.org/W2526148662","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W4296116869"],"abstract_inverted_index":{"The":[0,40,79],"parameterized":[1,43],"analysis":[2,45,70,81],"of":[3,10,18,33,42,49,57,67,71,82,97,109,132],"bio-inspired":[4,50,72],"computing":[5,51,73],"provides":[6],"a":[7,85,98,104,129],"new":[8],"way":[9],"gaining":[11],"additional":[12],"insights":[13],"into":[14],"the":[15,47,58,65,75,110],"working":[16],"behavior":[17],"popular":[19],"approaches":[20,36],"such":[21],"as":[22],"evolutionary":[23,118],"algorithms":[24,83],"and":[25,62,134],"ant":[26],"colony":[27],"optimization.":[28],"We":[29],"give":[30],"an":[31,117],"overview":[32],"two":[34],"important":[35],"in":[37,74],"this":[38],"area.":[39],"area":[41],"runtime":[44,48,69],"studies":[46],"with":[52],"respect":[53],"to":[54,92,103],"different":[55],"parameters":[56],"given":[59,86,99,130],"problem":[60,88,100,122],"instance":[61,101],"builds":[63],"on":[64],"success":[66],"rigorous":[68],"last":[76],"20":[77],"years.":[78],"feature-based":[80],"for":[84,120,138],"optimization":[87],"uses":[89,116],"statistical":[90],"methods":[91],"figure":[93],"out":[94],"which":[95],"features":[96],"lead":[102],"good":[105],"or":[106],"bad":[107],"performance":[108,126],"algorithm":[111,119,140],"under":[112],"consideration.":[113],"It":[114],"often":[115],"evolving":[121],"instances":[123],"that":[124],"exhibit":[125],"differences":[127],"between":[128],"set":[131],"solvers":[133],"can":[135],"be":[136],"used":[137],"effective":[139],"selection.":[141]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}