Sciweavers

868 search results - page 112 / 174
» Optimizing Logic Design Using Boolean Transforms
Sort
View
75
Voted
DATE
2009
IEEE
88views Hardware» more  DATE 2009»
15 years 4 months ago
Rewiring using IRredundancy Removal and Addition
—Redundancy Addition and Removal (RAR) is a restructuring technique used in the synthesis and optimization of logic designs. It can remove an existing target wire and add an alte...
Chun-Chi Lin, Chun-Yao Wang
FPGA
2006
ACM
141views FPGA» more  FPGA 2006»
15 years 1 months ago
A reconfigurable architecture for hybrid CMOS/Nanodevice circuits
This report describes a preliminary evaluation of possible performance of an FPGA-like architecture for future hybrid "CMOL" circuits which combine a semiconductor-trans...
Dmitri B. Strukov, Konstantin Likharev
ICCS
2001
Springer
15 years 2 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
15 years 4 months ago
Managing non-determinism in symbolic robot motion planning and control
Abstract— We study the problem of designing control strategies for nondeterministic transitions systems enforcing the satisfaction of Linear Temporal Logic (LTL) formulas over th...
Marius Kloetzer, Calin Belta
IBIS
2006
109views more  IBIS 2006»
14 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...