Sciweavers

2607 search results - page 10 / 522
» Complete Functional Synthesis
Sort
View
FPL
2005
Springer
107views Hardware» more  FPL 2005»
15 years 3 months ago
Programmable Numerical Function Generators: Architectures and Synthesis Method
This paper presents an architecture and a synthesis method for programmable numerical function generators of trigonometric functions, logarithm functions, square root, reciprocal,...
Tsutomu Sasao, Shinobu Nagayama, Jon T. Butler
ISVLSI
2007
IEEE
107views VLSI» more  ISVLSI 2007»
15 years 3 months ago
A Hash-based Approach for Functional Regularity Extraction During Logic Synthesis
Performance, power, and functionality, yield and manufacturability are rapidly becoming additional critical factors that must be considered at higher levels of ion. A possible sol...
Angelo P. E. Rosiello, Fabrizio Ferrandi, Davide P...
CORR
2008
Springer
109views Education» more  CORR 2008»
14 years 9 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko
ISIPTA
1999
IEEE
169views Mathematics» more  ISIPTA 1999»
15 years 1 months ago
Dempster-Belief Functions Are Based on the Principle of Complete Ignorance
This paper shows that a "principle of complete ignorance" plays a central role in decisions based on Dempster belief functions. Such belief functions occur when, in a fi...
Peter P. Wakker
SFP
2001
14 years 11 months ago
Function Types in Complete Type Inference
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
Manfred Widera, Christoph Beierle