Sciweavers

3238 search results - page 90 / 648
» Multi-return function call
Sort
View
DATE
1998
IEEE
100views Hardware» more  DATE 1998»
15 years 6 months ago
Combinational Verification based on High-Level Functional Specifications
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Bra...
99
Voted
AAAI
2007
15 years 4 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 5 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
VLDB
1991
ACM
128views Database» more  VLDB 1991»
15 years 5 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 2 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause