Sciweavers

206 search results - page 34 / 42
» On the numbers of variables to represent sparse logic functi...
Sort
View
LCPC
2001
Springer
13 years 12 months ago
Strength Reduction of Integer Division and Modulo Operations
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
Jeffrey Sheldon, Walter Lee, Ben Greenwald, Saman ...
MST
2010
140views more  MST 2010»
13 years 5 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ISMVL
2002
IEEE
113views Hardware» more  ISMVL 2002»
14 years 12 days ago
On the Construction of Multiple-Valued Decision Diagrams
Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-value...
D. Michael Miller, Rolf Drechsler
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 2 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...