乐胖代购免代理版

{"id":"https://openalex.org/W2019110286","doi":"https://doi.org/10.1109/icnc.2010.5584618","title":"A GRASP based algorithm for multi-constraint circuit partitioning","display_name":"A GRASP based algorithm for multi-constraint circuit partitioning","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2019110286","doi":"https://doi.org/10.1109/icnc.2010.5584618","mag":"2019110286"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584618","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5111955569","display_name":"Qingqing Zhan","orcid":null},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingqing Zhan","raw_affiliation_strings":["Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China"],"affiliations":[{"raw_affiliation_string":"Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100413098","display_name":"Wenxing Zhu","orcid":"https://orcid.org/0000-0002-8698-0024"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenxing Zhu","raw_affiliation_strings":["Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China"],"affiliations":[{"raw_affiliation_string":"Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100714222","display_name":"Xiuping He","orcid":"https://orcid.org/0000-0001-6665-569X"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Xiuping He","raw_affiliation_strings":["Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China"],"affiliations":[{"raw_affiliation_string":"Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,China","institution_ids":["https://openalex.org/I80947539"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.290489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":64,"max":71},"biblio":{"volume":null,"issue":null,"first_page":"3110","last_page":"3114"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9989,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9988,"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/partition-problem","display_name":"Partition problem","score":0.5507416}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9322753},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7636845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.64342076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5789511},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5507416},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5504972},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5048707},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.49091345},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.43924507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43300578},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3898965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22894195},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.19459069},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09130961},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.06694031},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584618","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":7,"referenced_works":["https://openalex.org/W1531949859","https://openalex.org/W2095117703","https://openalex.org/W2105931463","https://openalex.org/W2112469261","https://openalex.org/W2135270935","https://openalex.org/W2376762250","https://openalex.org/W4236269389"],"related_works":["https://openalex.org/W4251926495","https://openalex.org/W3135694647","https://openalex.org/W2896014154","https://openalex.org/W2744216431","https://openalex.org/W2541071804","https://openalex.org/W2393373993","https://openalex.org/W2094485034","https://openalex.org/W20026230","https://openalex.org/W1967029759","https://openalex.org/W1486115220"],"abstract_inverted_index":{"We":[0,16],"study":[1],"the":[2,13,21,52,66,101,118,122],"circuit":[3,14],"partitioning":[4],"problem":[5],"with":[6,36,41,79,91],"area":[7,42,69,80],"and":[8,43,70,81,94,109,121],"delay":[9,18,37,44,71,82],"constraints":[10,19,45,83],"to":[11,34],"optimize":[12],"performance.":[15],"integrate":[17],"into":[20],"greedy":[22],"randomized":[23],"adaptive":[24],"search":[25],"procedure":[26],"(GRASP),":[27],"so":[28],"that":[29],"GRASP":[30,40],"can":[31,46,76],"be":[32],"used":[33],"deal":[35],"problems.":[38],"The":[39,85],"generate":[47],"better":[48,112],"initial":[49,53],"partitions.":[50],"Then":[51],"partition":[54,67],"is":[55],"iteratively":[56],"improved":[57],"by":[58],"an":[59],"extended":[60],"FM":[61,92],"algorithm.":[62],"Finally":[63],"we":[64],"obtain":[65],"satisfying":[68],"constraints.":[72],"Our":[73],"hybrid":[74,98],"algorithm":[75,93,99],"solve":[77],"bi-partition":[78],"successfully.":[84],"experimental":[86],"results":[87],"indicate":[88],"that,":[89],"compared":[90],"clustering":[95],"algorithm,":[96],"our":[97],"improves":[100],"solution":[102],"quality":[103],"in":[104,115],"a":[105,111],"reasonable":[106],"computational":[107],"time,":[108],"obtains":[110],"partition,":[113],"especially":[114],"terms":[116],"of":[117],"minimum":[119],"cut-size":[120],"average":[123],"cut-size.":[124]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2019110286","counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-01-19T04:22:08.485070","created_date":"2016-06-24"}