Sciweavers

8 search results - page 2 / 2
» Finding Rough Set Reducts with SAT
Sort
View
SAT
2010
Springer
141views Hardware» more  SAT 2010»
13 years 9 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
CCCG
2009
13 years 6 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
13 years 12 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...