{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:57:38Z","timestamp":1759147058287,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.23919\/date.2018.8341975","type":"proceedings-article","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T19:20:11Z","timestamp":1524511211000},"page":"31-36","source":"Crossref","is-referenced-by-count":7,"title":["A fast and effective lookahead and fractional search based scheduling algorithm for high-level synthesis"],"prefix":"10.23919","author":[{"given":"Shantanu","family":"Dutt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ouwen","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.489119"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/78.403355"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.2003.1183177"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MPCS.1994.367017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.56"},{"year":"0","key":"ref15"},{"journal-title":"Computer Arithmetic Algorithms and Hardware Designs","year":"2009","author":"parhami","key":"ref16"},{"key":"ref17","article-title":"Wire routing by optimizing channel assignment withn large apertures","author":"hashimoto","year":"1971","journal-title":"Proc of the 8th Design Automation Workshop"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/43.31522"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/37888.37918"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1992.279359"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/EDAC.1991.206441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/43.238604"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147025"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/43.75629"},{"key":"ref1","first-page":"20","article-title":"A new integer linear programming formulation for the scheduling problem in data path synthesis","author":"lee","year":"1989","journal-title":"ICCAD"},{"key":"ref9","first-page":"1010","article-title":"Ant Colony ORtimizations for Resource-and Timing-Constrained Operation Scheduling","volume":"26","author":"wang","year":"2007","journal-title":"TCAD"}],"event":{"name":"2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)","start":{"date-parts":[[2018,3,19]]},"location":"Dresden, Germany","end":{"date-parts":[[2018,3,23]]}},"container-title":["2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8337149\/8341968\/08341975.pdf?arnumber=8341975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T14:32:26Z","timestamp":1525789946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8341975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":17,"URL":"https:\/\/doi.org\/10.23919\/date.2018.8341975","relation":{},"subject":[],"published":{"date-parts":[[2018,3]]}}}