activity
20212024
most citedMachine Learning Methods in Solving the Boolean Satisfiability Problem

26 citations · 119 across the 19 of their papers we have counts for

collaborators
Showing 2023Show all

8 papers · 1 filter

cs.AR2023★ 11 cited

LLM4EDA: Emerging Progress in Large Language Models for Electronic Design Automation

Ruizhe Zhong, Xingbo Du, Shixiong Kai +7

Driven by Moore's Law, the complexity and scale of modern chip design are increasing rapidly. Electronic Design Automation (EDA) has been widely applied to address the challenges e…

cs.AR2023★ 3 cited

A Circuit Domain Generalization Framework for Efficient Logic Synthesis in Chip Design

Zhihai Wang, Lei Chen, Jie Wang +7

Logic Synthesis (LS) plays a vital role in chip design -- a cornerstone of the semiconductor industry. A key task in LS is to transform circuits -- modeled by directed acyclic grap…

cs.LG2023★ 3 cited

DeepGate2: Functionality-Aware Circuit Representation Learning

Zhengyuan Shi, Hongyang Pan, Sadaf Khan +7

Circuit representation learning aims to obtain neural representations of circuit elements and has emerged as a promising research direction that can be applied to various EDA and l…

cs.OS2023

SGDP: A Stream-Graph Neural Network Based Data Prefetcher

Yiyuan Yang, Rongshang Li, Qiquan Shi +4

Data prefetching is important for storage system optimization and access performance improvement. Traditional prefetchers work well for mining access patterns of sequential logical…

cs.AI2023

Conflict-driven Structural Learning Towards Higher Coverage Rate in ATPG

Hui-Ling Zhen, Naixing Wang, Junhua Huang +3

Due to the increasing challenges posed by the relentless rise in the design complexity of integrated circuits, Boolean Satisfiability (SAT) has emerged as a robust alternative to s…

cs.AI2023★ 19 cited

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Fei Liu, Chengyu Lu, Lin Gui +3

Vehicle routing is a well-known optimization research topic with significant practical importance. Among different approaches to solving vehicle routing, heuristics can produce a s…

cs.AI2023★ 1 cited

HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline

Yang Li, Xinyan Chen, Wenxuan Guo +6

Industrial SAT formula generation is a critical yet challenging task. Existing SAT generation approaches can hardly simultaneously capture the global structural properties and main…

cs.LG2023★ 15 cited

Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model

Zhihai Wang, Xijun Li, Jie Wang +5

Cutting planes (cuts) are important for solving mixed-integer linear programs (MILPs), which formulate a wide range of important real-world applications. Cut selection -- which aim…