A scalable universal Ising machine based on interaction-centric storage and compute-in-memory

W Yue, T Zhang, Z Jing, K Wu, Y Yang, Z Yang… - Nature …, 2024 - nature.com
Ising machines are annealing processors that can solve combinatorial optimization
problems via the physical evolution of the corresponding Ising graphs. Such machines are …

VLSI placement parameter optimization using deep reinforcement learning

A Agnesina, K Chang, SK Lim - … of the 39th international conference on …, 2020 - dl.acm.org
The quality of placement is essential in the physical design flow. To achieve PPA goals, a
human engineer typically spends a considerable amount of time tuning the multiple settings …

Graph coloring for air traffic flow management

N Barnier, P Brisset - Annals of operations research, 2004 - Springer
Abstract The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the
airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their …

Effective iterative techniques for fingerprinting design IP

AE Caldwell, HJ Choi, AB Kahng, S Mantik… - Proceedings of the 36th …, 1999 - dl.acm.org
While previous watermarking-based approaches to intellectual property protection (IPP)
have asymmetrically emphasized the IP provider's rights, the true goal of IPP is to ensure the …

Application-specific memory management for embedded systems using software-controlled caches

D Chiou, P Jain, L Rudolph, S Devadas - Proceedings of the 37th …, 2000 - dl.acm.org
We propose a way to improve the performance of embedded processors running data-
intensive applications by allowing software to allocate on-chip memory on an application …

[图书][B] Intellectual property protection in VLSI designs: theory and practice

G Qu, M Potkonjak - 2007 - books.google.com
The development and implementation of intellectual property (IP) protection mechanisms is
of crucial importance for the emerging reuse-based system design methodology. Maybe …

[PDF][PDF] School timetable construction: algorithms and complexity

RJ Willemen - 2002 - research.tue.nl
School timetable construction problems are interesting objects to study because neither
modeling nor solving them is straightforward. It is difficult to make a clear-cut distinction …

Overlay techniques for scratchpad memories in low power embedded processors

M Verma, P Marwedel - IEEE Transactions on Very Large Scale …, 2006 - ieeexplore.ieee.org
Energy consumption is one of the important parameters to be optimized during the design of
portable embedded systems. Thus, most of the contemporary portable devices feature low …

[PDF][PDF] Why is ATPG easy?

MR Prasad, P Chong, K Keutzer - Proceedings of the 36th Annual ACM …, 1999 - dl.acm.org
Empirical observation shows that practically encountered instances of ATPG are efficiently
solvable. However, it has been known for more than two decades that ATPG is an NP …

An unconstrained quadratic binary programming approach to the vertex coloring problem

GA Kochenberger, F Glover, B Alidaee… - Annals of Operations …, 2005 - Springer
The vertex coloring problem has been the subject of extensive research for many years.
Driven by application potential as well as computational challenge, a variety of methods …