206 search results - page 6 / 42 » On the numbers of variables to represent sparse logic functi... |
COMPUTING
2006
14 years 11 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
102
click to vote
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
116
Voted
UAI
2000
15 years 29 days ago
2000
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...
82
Voted
DAC
2005
ACM
16 years 17 days ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...