2023
DOI: 10.1007/s11227-023-05109-2
|View full text |Cite
|
Sign up to set email alerts
|

A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 62 publications
0
1
0
Order By: Relevance
“…To optimize hardware through its high-level description, a range of optimization techniques can be employed across different levels of granularity, from coarse-grained levels such as task graphs to fine-grained levels such as data flow graphs [19,20]. Computer arithmetic provides a suite of efficient methods and tools for minimizing the processing requirements of specific tasks, particularly at the fine-grained level [21][22][23].…”
Section: Introductionmentioning
confidence: 99%
“…To optimize hardware through its high-level description, a range of optimization techniques can be employed across different levels of granularity, from coarse-grained levels such as task graphs to fine-grained levels such as data flow graphs [19,20]. Computer arithmetic provides a suite of efficient methods and tools for minimizing the processing requirements of specific tasks, particularly at the fine-grained level [21][22][23].…”
Section: Introductionmentioning
confidence: 99%