Sciweavers

1847 search results - page 119 / 370
» Hybrid Functional Interpretations
Sort
View
IBIS
2006
109views more  IBIS 2006»
15 years 5 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
TSMC
2002
132views more  TSMC 2002»
15 years 5 months ago
Intelligent agent based framework for manufacturing systems control
Existing modeling frameworks for manufacturing system control can be classified into hierarchical, heterarchical, and hybrid control frameworks. The main drawbacks of existing fram...
Sunderesh S. Heragu, Robert J. Graves, Byung-In Ki...
GLVLSI
2007
IEEE
158views VLSI» more  GLVLSI 2007»
16 years 2 days ago
Design of a versatile and cost-effective hybrid floating-point/LNS arithmetic processor
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...
Chichyang Chen, Paul Chow
FPCA
1989
15 years 9 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 5 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud