Sciweavers

13376 search results - page 444 / 2676
» Problem Solving with
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
15 years 7 months ago
Ordered escape routing based on Boolean satisfiability
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...
Lijuan Luo, Martin D. F. Wong
135
Voted
IPL
2000
69views more  IPL 2000»
15 years 4 months ago
Generating all maximal models of a Boolean expression
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...
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 10 months ago
Leveraging dominators for preprocessing QBF
— 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,...
ISBI
2007
IEEE
15 years 11 months ago
Fast Image Reconstruction Methods for Fully 3d Multispectral Optical Bioluminescence Tomography
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...

Publication
2630views
17 years 4 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
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...
RYO TAKEI