نتایج جستجو برای: optimizing

تعداد نتایج: 53232  

Journal: :IBM Systems Journal 1970
Mark Elson Stephen T. Rake

The design of an optimizing compiler for a large and rich language poses problems beyond those of sheer size and cost. One of the most serious is that the wealth and variety of the language makes it possible to express the same logical function in terms of many different source constructs. The choice may be based on naturalness of language use, program readability, ease of debugging, compil...

2004
Tai-Hung Liu Khurram Sajid Adnan Aziz Vigyan Singhal

We define a notion of equivalence for designs containing black boxes i.e., components whose functionality is not known: these arise naturally in the course of hierarchical design. Using this notion, we describe a sound and complete methodology for optimizing such designs.

1999
Roland Olsson

The paper presents the abstraction transformation which is a fundamental method for creating functions in ADATE. The use of abstraction turns out to be similar to evolution by gene duplication which is emerging as the most important theory of \building blocks" in natural genomes. We discuss the relationship between abstraction and its natural counterparts, but also give novel technical details ...

Journal: :علوم و تکنولوژی پلیمر 0
مهدی شیوا حسین آتشی

the blending of nr and br rubber blend with n330 carbon black is studied on curing behavior and the physico-mechanical properties of a sbr rubber based tire tread compound containing n234 carbon black. the effect of sulphur and accelerator contents on different properties of rubber compound is also tested with a wide range of curing agents. partial substitution of sbr with nr shows significant ...

Journal: :Softw., Pract. Exper. 1992
Kenneth Walker Ralph E. Griswold

return real } inline { if (x <= 0.0) { drunerr(205, x); errfail: } if is:null(b) then } inline { return C_double log(x); ) else { if !cnv:C_double(b) then runerr(102, b) b o d y { static double Iastbase = 0.0; static double divisor; if (b <= 1.0) { drunerr(205, b); errfail; } if (b != Iastbase) { divisor = log(b); Iastbase = b; } x = log(x) / divisor; return C_double x;

1994
David B. Kemp Kotagiri Ramamohanarao

We present an eecient evaluation technique for modularly stratiied programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMS-programs) in which one can easily express problems such as shortest distance, company ownership, bill of materials, preferential vote counting, and matrix diagonalization. Programs written ...

1998
C. Robert Morgan

Compiler courses have been an academic mainstay in both undergraduate and graduate computer science departments. These courses emphasize either the implementation of languages or parallel processing. Little analysis is...

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1999
Daniel Keren Craig Gotsman

A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: Although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components, etc. Previous work tackled these problems by optimizing heuristic cost functions, which penalize some of these topological problems in the fit. This paper suggests a different ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید