98 search results - page 8 / 20 » Optimal Non-deterministic Functional Logic Computations |
82
Voted
ISQED
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Reliability enhancements are traditionally implemented through redundancies at the system level or through the use of harden-cell-designs at the circuit level. Reliabil...
102
click to vote
JFP
2000
14 years 11 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
112
click to vote
FPGA
2004
ACM
15 years 5 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
106
Voted
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
105
Voted
DAC
1994
ACM
15 years 3 months ago
1994
ACM
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...