Sciweavers

5506 search results - page 89 / 1102
» Minimal Logic Programs
Sort
View
110
Voted
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
AI
2006
Springer
15 years 26 days ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
120
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Block permutations in Boolean Space to minimize TCAM for packet classification
Packet classification is one of the major challenges in designing high-speed routers and firewalls as it involves sophisticated multi-dimensional searching. Ternary Content Address...
Rihua Wei, Yang Xu, H. Jonathan Chao
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 24 days ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...