98 search results - page 4 / 20 » Optimal Non-deterministic Functional Logic Computations |
PPDP
2001
Springer
13 years 11 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
PVLDB
2011
13 years 1 months ago
2011
New hardware platforms, e.g. cloud, multi-core, etc., have led to a reconsideration of database system architecture. Our Deuteronomy project separates transactional functionality ...
ICCAD
2007
IEEE
14 years 3 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
ISMVL
2008
IEEE
14 years 1 months ago
2008
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
DAC
2005
ACM
14 years 8 months 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...