Sciweavers

4255 search results - page 60 / 851
» On Learning Boolean Functions
Sort
View
AI
2002
Springer
14 years 9 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
TIT
2008
123views more  TIT 2008»
14 years 9 months ago
Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
A method for constructing differentially 4-uniform quadratic hexanomials has been recently introduced by J. Dillon. We give various generalizations of this method and we deduce th...
Lilya Budaghyan, Claude Carlet
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
15 years 6 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
TCAD
2008
112views more  TCAD 2008»
14 years 9 months ago
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
Yu Hu, Victor Shih, Rupak Majumdar, Lei He
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
15 years 6 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser