{"id":"https://openalex.org/W1989010571","doi":"https://doi.org/10.1142/s0218126602000422","title":"BINDING ALGORITHM FOR POWER OPTIMIZATION BASED ON NETWORK FLOW METHOD","display_name":"BINDING ALGORITHM FOR POWER OPTIMIZATION BASED ON NETWORK FLOW METHOD","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W1989010571","doi":"https://doi.org/10.1142/s0218126602000422","mag":"1989010571"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126602000422","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126602000422","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-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/A5051252924","display_name":"Yoonseo Choi","orcid":"https://orcid.org/0000-0001-6808-2848"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"YOONSEO CHOI","raw_affiliation_strings":["Department of Electrical Engineering & Computer Science, and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science & Technology, Taejon, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering & Computer Science, and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science & Technology, Taejon, Korea","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049474875","display_name":"Taewhan Kim","orcid":"https://orcid.org/0000-0002-6114-3772"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"TAEWHAN KIM","raw_affiliation_strings":["Department of Electrical Engineering & Computer Science, and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science & Technology, Taejon, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering & Computer Science, and Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science & Technology, Taejon, Korea","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051252924"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12083599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"03","first_page":"259","last_page":"271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998000264167786,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9976999759674072,"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/computation","display_name":"Computation","score":0.7063145041465759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.686030387878418},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6436766982078552},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6038426160812378},{"id":"https://openalex.org/keywords/power-flow","display_name":"Power flow","score":0.5596456527709961},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.558434247970581},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5185542702674866},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4850980043411255},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4816550016403198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4623478651046753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4577639698982239},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4505499005317688},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4212874472141266},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.41349518299102783},{"id":"https://openalex.org/keywords/electric-power-system","display_name":"Electric power system","score":0.20489320158958435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1991707682609558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17886915802955627}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7063145041465759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.686030387878418},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6436766982078552},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6038426160812378},{"id":"https://openalex.org/C2986056383","wikidata":"https://www.wikidata.org/wiki/Q556030","display_name":"Power flow","level":4,"score":0.5596456527709961},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.558434247970581},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5185542702674866},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4850980043411255},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4816550016403198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4623478651046753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4577639698982239},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4505499005317688},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4212874472141266},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.41349518299102783},{"id":"https://openalex.org/C89227174","wikidata":"https://www.wikidata.org/wiki/Q2388981","display_name":"Electric power system","level":3,"score":0.20489320158958435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1991707682609558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17886915802955627},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126602000422","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126602000422","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"},{"id":"https://openalex.org/F4320322348","display_name":"Korea Science and Engineering Foundation","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320322942","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2003547208","https://openalex.org/W4233356184","https://openalex.org/W4248059597","https://openalex.org/W4252943619"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W1970952976","https://openalex.org/W2182648737"],"abstract_inverted_index":{"We":[0],"propose":[1,106],"an":[2,34],"efficient":[3,83],"binding":[4,21,115],"algorithm":[5,151],"for":[6,23,123],"power":[7],"optimization":[8],"in":[9,86,131,161],"behavioral":[10],"synthesis.":[11],"In":[12],"prior":[13],"work,":[14],"it":[15,91,138],"has":[16],"been":[17],"shown":[18],"that":[19,90,148],"several":[20],"problems":[22,31],"low-power":[24],"can":[25,75],"be":[26,42],"formulated":[27],"as":[28],"multi-commodity":[29,48],"flow":[30,39,49,84,127],"(due":[32],"to":[33,57,95],"iterative":[35],"execution":[36],"of":[37,60,72,79,82,128,144],"data":[38],"graph)":[40],"and":[41,134],"solved":[43],"optimally.":[44],"However,":[45],"since":[46],"the":[47,53,66,70,80,120,149,153],"problem":[50,71],"is":[51,55,92],"NP-hard,":[52],"application":[54],"limited":[56],"a":[58,87,107,113,125,132,142],"class":[59],"small":[61],"sized":[62],"problems.":[63],"To":[64,102],"overcome":[65],"limitation,":[67],"we":[68,74,105],"address":[69],"how":[73],"effectively":[76],"make":[77],"use":[78],"property":[81],"computations":[85],"network":[88,133],"so":[89],"extensively":[93],"applicable":[94],"practical":[96,163],"designs":[97],"while":[98,157],"producing":[99],"close-to-optimal":[100,159],"results.":[101],"this":[103],"end,":[104],"two-step":[108],"procedure,":[109],"which":[110],"(1)":[111],"determines":[112],"feasible":[114],"solution":[116],"by":[117],"partially":[118],"utilizing":[119],"computation":[121],"steps":[122],"finding":[124],"maximum":[126],"minimum":[129],"cost":[130],"then":[135],"(2)":[136],"refines":[137],"iteratively.":[139],"Experiments":[140],"with":[141],"set":[143],"benchmark":[145],"examples":[146],"show":[147],"proposed":[150],"saves":[152],"run":[154],"time":[155],"significantly":[156],"maintaining":[158],"bindings":[160],"most":[162],"designs.":[164]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}