Sciweavers

756 search results - page 19 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
CIS
2005
Springer
14 years 1 months ago
Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning
⎯A new nonslicing floorplan representation, the moving block sequence (MBS), is proposed in this paper. Our idea of the MBS originates from the observation that placing blocks on...
Jing Liu, Weicai Zhong, Licheng Jiao
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
14 years 2 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
WSCG
2004
120views more  WSCG 2004»
13 years 9 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
INDOCRYPT
2005
Springer
14 years 1 months ago
On the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
An Braeken, Bart Preneel
DAC
2003
ACM
14 years 9 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant