Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
We investigate fast iterative image reconstruction methods for fully 3D multispectral optical bioluminescence tomography where inhomogeneous optical properties are modeled using t...
Sangtae Ahn, Abhijit J. Chaudhari, Felix Darvas, C...
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...