{"id":"https://openalex.org/W2149150903","doi":"https://doi.org/10.1109/icvd.2003.1183176","title":"A game-theoretic approach for binding in behavioral synthesis","display_name":"A game-theoretic approach for binding in behavioral synthesis","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W2149150903","doi":"https://doi.org/10.1109/icvd.2003.1183176","mag":"2149150903"},"language":"en","primary_location":{"id":"doi:10.1109/icvd.2003.1183176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icvd.2003.1183176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th International Conference on VLSI Design, 2003. Proceedings.","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/A5048437426","display_name":"Ashok K. Murugavel","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.K. Murugavel","raw_affiliation_strings":["Department of Computer Science and Engineering, Nanomaterials and Nanomanufacturing Research Center, University of South Florida, Tampa, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Nanomaterials and Nanomanufacturing Research Center, University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027665366","display_name":"N. Ranganathan","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Ranganathan","raw_affiliation_strings":["Department of Computer Science and Engineering, Nanomaterials and Nanomanufacturing Research Center, University of South Florida, Tampa, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Nanomaterials and Nanomanufacturing Research Center, University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7713,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8581733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"452","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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":0.998199999332428,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9965999722480774,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/datapath","display_name":"Datapath","score":0.8396642804145813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6585069298744202},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.6443920731544495},{"id":"https://openalex.org/keywords/bidding","display_name":"Bidding","score":0.6406928896903992},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.6308404207229614},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6029007434844971},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5849152207374573},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5239738821983337},{"id":"https://openalex.org/keywords/high-level-synthesis","display_name":"High-level synthesis","score":0.5016639232635498},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47557535767555237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28761500120162964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18812787532806396},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13287267088890076},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.12165087461471558},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.10335609316825867}],"concepts":[{"id":"https://openalex.org/C2781198647","wikidata":"https://www.wikidata.org/wiki/Q1633673","display_name":"Datapath","level":2,"score":0.8396642804145813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6585069298744202},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6443920731544495},{"id":"https://openalex.org/C9233905","wikidata":"https://www.wikidata.org/wiki/Q3276328","display_name":"Bidding","level":2,"score":0.6406928896903992},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.6308404207229614},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6029007434844971},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5849152207374573},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5239738821983337},{"id":"https://openalex.org/C58013763","wikidata":"https://www.wikidata.org/wiki/Q5754574","display_name":"High-level synthesis","level":3,"score":0.5016639232635498},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47557535767555237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28761500120162964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18812787532806396},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13287267088890076},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.12165087461471558},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.10335609316825867},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"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/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icvd.2003.1183176","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icvd.2003.1183176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th International Conference on VLSI Design, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1563592233","https://openalex.org/W1567363020","https://openalex.org/W1578630563","https://openalex.org/W1941899280","https://openalex.org/W2017990047","https://openalex.org/W2034674049","https://openalex.org/W2075567596","https://openalex.org/W2099471081","https://openalex.org/W2100596926","https://openalex.org/W2115308358","https://openalex.org/W2118024052","https://openalex.org/W2125537511","https://openalex.org/W2150749964","https://openalex.org/W2155161598","https://openalex.org/W2156992164","https://openalex.org/W2158615334","https://openalex.org/W2162908425","https://openalex.org/W2163489105","https://openalex.org/W2330024298","https://openalex.org/W4234761190","https://openalex.org/W4237989062","https://openalex.org/W6640491713","https://openalex.org/W6682819323"],"related_works":["https://openalex.org/W2166021916","https://openalex.org/W1903431847","https://openalex.org/W1994884893","https://openalex.org/W1839177134","https://openalex.org/W3149874529","https://openalex.org/W2135482679","https://openalex.org/W2084005807","https://openalex.org/W2137686989","https://openalex.org/W2004001588","https://openalex.org/W2375695813"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"describe":[4],"a":[5,18,38,60],"new":[6],"algorithm":[7,107,113],"based":[8,32,42],"on":[9,43],"game":[10,35,131],"theory":[11],"for":[12,36,63,108,134],"minimizing":[13],"the":[14,44,48,55,68,73,80,84,91,105,129,142],"average":[15],"power":[16,70,86,109,115],"of":[17,93,139],"circuit":[19],"during":[20],"binding":[21,49,106,135],"in":[22,54,120],"behavioral":[23],"synthesis.":[24],"The":[25,75,111],"problem":[26],"is":[27,40,57,88],"formulated":[28],"as":[29,59,72],"an":[30,65,137],"auction":[31],"non-cooperative":[33],"finite":[34],"which":[37],"solution":[39,133],"proposed":[41,112,130],"Nash":[45],"equilibrium.":[46],"For":[47],"algorithm,":[50],"each":[51],"functional":[52,94],"unit":[53,95],"datapath":[56],"modeled":[58],"player":[61],"bidding":[62],"executing":[64],"operation":[66],"with":[67],"estimated":[69],"consumption":[71,87],"bid.":[74],"operations":[76],"are":[77,102],"bound":[78],"to":[79],"modules":[81],"such":[82],"that":[83,128],"total":[85],"minimized.":[89],"Further,":[90],"techniques":[92],"sharing,":[96],"path":[97],"balancing":[98],"and":[99],"register":[100],"assignment":[101],"incorporated":[103],"within":[104],"reduction.":[110],"yields":[114,136],"reduction":[116],"without":[117],"any":[118],"increase":[119],"area":[121],"or":[122],"delay":[123],"overhead.":[124],"Experimental":[125],"results":[126],"indicate":[127],"theoretic":[132],"improvement":[138],"13.9%":[140],"over":[141],"linear":[143],"programming":[144],"(LP)":[145],"method.":[146]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}